/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:27:15,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:27:15,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:27:15,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:27:15,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:27:15,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:27:15,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:27:15,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:27:15,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:27:15,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:27:15,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:27:15,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:27:15,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:27:15,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:27:15,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:27:15,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:27:15,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:27:15,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:27:15,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:27:15,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:27:15,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:27:15,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:27:15,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:27:15,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:27:15,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:27:15,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:27:15,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:27:15,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:27:15,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:27:15,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:27:15,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:27:15,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:27:15,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:27:15,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:27:15,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:27:15,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:27:15,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:27:15,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:27:15,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:27:15,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:27:15,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:27:15,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:27:15,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:27:15,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:27:15,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:27:15,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:27:15,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:27:15,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:27:15,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:27:15,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:27:15,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:27:15,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:27:15,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:27:15,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:27:15,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:27:15,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:27:15,523 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:27:15,523 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:27:15,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:27:15,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:27:15,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:27:15,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:27:15,802 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:27:15,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-04-15 11:27:15,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e59de02d/1eac7b867f614d35b0dfa523f2e8eed3/FLAG4f16d83c2 [2022-04-15 11:27:16,429 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:27:16,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-04-15 11:27:16,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e59de02d/1eac7b867f614d35b0dfa523f2e8eed3/FLAG4f16d83c2 [2022-04-15 11:27:16,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e59de02d/1eac7b867f614d35b0dfa523f2e8eed3 [2022-04-15 11:27:16,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:27:16,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:27:16,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:27:16,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:27:16,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:27:16,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:27:16" (1/1) ... [2022-04-15 11:27:16,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3410af99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:16, skipping insertion in model container [2022-04-15 11:27:16,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:27:16" (1/1) ... [2022-04-15 11:27:16,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:27:16,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:27:17,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-04-15 11:27:17,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:27:17,360 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:27:17,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-04-15 11:27:17,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:27:17,631 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:27:17,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17 WrapperNode [2022-04-15 11:27:17,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:27:17,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:27:17,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:27:17,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:27:17,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:27:17,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:27:17,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:27:17,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:27:17,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (1/1) ... [2022-04-15 11:27:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:27:17,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:27:17,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:27:17,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:27:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:27:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:27:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PVOID~0~X~$Pointer$~X~$Pointer$~X~~PBOOLEAN~0~TO~~NTSTATUS~0 [2022-04-15 11:27:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PKEYBOARD_INPUT_DATA~0~X~~POUTPUT_PACKET~0~X~~UCHAR~0~X~~PUCHAR~0~X~~PBOOLEAN~0~X~~PKEYBOARD_SCAN_STATE~0~TO~~BOOLEAN~0 [2022-04-15 11:27:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-04-15 11:27:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:27:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 11:27:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-15 11:27:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-15 11:27:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IoCtl [2022-04-15 11:27:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 11:27:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_AddDevice [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-04-15 11:27:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InitializationRoutine [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_IsrHook [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_ServiceCallback [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Unload [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-15 11:27:17,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:27:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-15 11:27:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-15 11:27:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 11:27:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-15 11:27:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-15 11:27:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-15 11:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-15 11:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-15 11:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-15 11:27:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-15 11:27:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-15 11:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-15 11:27:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:27:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-15 11:27:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:27:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:27:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-15 11:27:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-15 11:27:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 11:27:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-15 11:27:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-15 11:27:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-15 11:27:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 11:27:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-15 11:27:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:27:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-15 11:27:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:27:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:27:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:27:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 11:27:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 11:27:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-15 11:27:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-15 11:27:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:27:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_AddDevice [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IoCtl [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-15 11:27:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InitializationRoutine [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_IsrHook [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_ServiceCallback [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Unload [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:27:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PVOID~0~X~$Pointer$~X~$Pointer$~X~~PBOOLEAN~0~TO~~NTSTATUS~0 [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PKEYBOARD_INPUT_DATA~0~X~~POUTPUT_PACKET~0~X~~UCHAR~0~X~~PUCHAR~0~X~~PBOOLEAN~0~X~~PKEYBOARD_SCAN_STATE~0~TO~~BOOLEAN~0 [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~PVOID~0~X~~PVOID~0~X~~PVOID~0~TO~VOID [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 11:27:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:27:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:27:18,460 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:27:18,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:27:18,503 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:18,587 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:18,587 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:18,588 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:18,603 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:18,603 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:18,636 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:18,650 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:18,650 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:18,651 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:18,677 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:18,677 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:18,684 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:18,703 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:18,703 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,022 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,034 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,034 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,035 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,055 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,055 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,056 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,082 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,082 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,100 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,127 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,127 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,128 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,135 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,135 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,137 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,150 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,150 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,197 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,204 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,204 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,204 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,211 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,211 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,225 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,408 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-15 11:27:19,408 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-15 11:27:19,422 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-04-15 11:27:19,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-04-15 11:27:19,455 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:19,461 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:19,461 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:19,464 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,324 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-15 11:27:21,324 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-15 11:27:21,489 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,495 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:21,495 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:21,675 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:21,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:21,706 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,723 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-04-15 11:27:21,723 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-04-15 11:27:21,733 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,743 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 11:27:21,743 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 11:27:21,788 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:21,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:21,799 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 11:27:21,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 11:27:21,850 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:27:21,857 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:27:21,857 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:27:21,922 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:27:21,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:27:21,933 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 11:27:21,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:27:21 BoogieIcfgContainer [2022-04-15 11:27:21,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:27:21,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:27:21,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:27:21,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:27:21,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:27:16" (1/3) ... [2022-04-15 11:27:21,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee1c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:27:21, skipping insertion in model container [2022-04-15 11:27:21,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:27:17" (2/3) ... [2022-04-15 11:27:21,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee1c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:27:21, skipping insertion in model container [2022-04-15 11:27:21,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:27:21" (3/3) ... [2022-04-15 11:27:21,942 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-04-15 11:27:21,946 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:27:21,946 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:27:21,981 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:27:21,986 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:27:21,986 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:27:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 230 states have (on average 1.5) internal successors, (345), 248 states have internal predecessors, (345), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-15 11:27:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:27:22,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:22,018 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:27:22,018 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:22,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1774662017, now seen corresponding path program 1 times [2022-04-15 11:27:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:22,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037710135] [2022-04-15 11:27:22,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1774662017, now seen corresponding path program 2 times [2022-04-15 11:27:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623224641] [2022-04-15 11:27:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:22,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {311#true} is VALID [2022-04-15 11:27:22,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2022-04-15 11:27:22,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #1270#return; {311#true} is VALID [2022-04-15 11:27:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:27:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {311#true} is VALID [2022-04-15 11:27:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2022-04-15 11:27:22,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} #1216#return; {311#true} is VALID [2022-04-15 11:27:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:27:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:27:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:22,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#true} ~cond := #in~cond; {311#true} is VALID [2022-04-15 11:27:22,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume 0 == ~cond;assume false; {312#false} is VALID [2022-04-15 11:27:22,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#false} assume true; {312#false} is VALID [2022-04-15 11:27:22,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312#false} {311#true} #1254#return; {312#false} is VALID [2022-04-15 11:27:22,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {311#true} is VALID [2022-04-15 11:27:22,673 INFO L272 TraceCheckUtils]: 1: Hoare triple {311#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {311#true} is VALID [2022-04-15 11:27:22,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} ~cond := #in~cond; {311#true} is VALID [2022-04-15 11:27:22,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} assume 0 == ~cond;assume false; {312#false} is VALID [2022-04-15 11:27:22,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#false} assume true; {312#false} is VALID [2022-04-15 11:27:22,676 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {312#false} {311#true} #1254#return; {312#false} is VALID [2022-04-15 11:27:22,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#false} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {312#false} is VALID [2022-04-15 11:27:22,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#false} assume true; {312#false} is VALID [2022-04-15 11:27:22,677 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {312#false} {311#true} #1218#return; {312#false} is VALID [2022-04-15 11:27:22,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {311#true} call ULTIMATE.init(); {328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:27:22,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {311#true} is VALID [2022-04-15 11:27:22,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} assume true; {311#true} is VALID [2022-04-15 11:27:22,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#true} {311#true} #1270#return; {311#true} is VALID [2022-04-15 11:27:22,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#true} call #t~ret213 := main(); {311#true} is VALID [2022-04-15 11:27:22,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {311#true} is VALID [2022-04-15 11:27:22,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {311#true} call _BLAST_init(); {329#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:22,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {311#true} is VALID [2022-04-15 11:27:22,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#true} assume true; {311#true} is VALID [2022-04-15 11:27:22,687 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {311#true} {311#true} #1216#return; {311#true} is VALID [2022-04-15 11:27:22,689 INFO L272 TraceCheckUtils]: 10: Hoare triple {311#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {330#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:27:22,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {311#true} is VALID [2022-04-15 11:27:22,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {311#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {311#true} is VALID [2022-04-15 11:27:22,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#true} ~cond := #in~cond; {311#true} is VALID [2022-04-15 11:27:22,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#true} assume 0 == ~cond;assume false; {312#false} is VALID [2022-04-15 11:27:22,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#false} assume true; {312#false} is VALID [2022-04-15 11:27:22,690 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {312#false} {311#true} #1254#return; {312#false} is VALID [2022-04-15 11:27:22,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#false} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {312#false} is VALID [2022-04-15 11:27:22,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {312#false} assume true; {312#false} is VALID [2022-04-15 11:27:22,691 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {312#false} {311#true} #1218#return; {312#false} is VALID [2022-04-15 11:27:22,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {312#false} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {312#false} is VALID [2022-04-15 11:27:22,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {312#false} assume !(~status~5 >= 0); {312#false} is VALID [2022-04-15 11:27:22,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {312#false} assume !(1 == ~pended~0); {312#false} is VALID [2022-04-15 11:27:22,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {312#false} assume !(1 == ~pended~0); {312#false} is VALID [2022-04-15 11:27:22,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {312#false} assume !(~s~0 == ~UNLOADED~0); {312#false} is VALID [2022-04-15 11:27:22,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {312#false} assume !(-1 == ~status~5); {312#false} is VALID [2022-04-15 11:27:22,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {312#false} assume !(~s~0 != ~SKIP2~0); {312#false} is VALID [2022-04-15 11:27:22,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {312#false} assume 1 == ~pended~0; {312#false} is VALID [2022-04-15 11:27:22,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {312#false} assume 259 != ~status~5; {312#false} is VALID [2022-04-15 11:27:22,696 INFO L272 TraceCheckUtils]: 29: Hoare triple {312#false} call errorFn(); {312#false} is VALID [2022-04-15 11:27:22,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-04-15 11:27:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623224641] [2022-04-15 11:27:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623224641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:22,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:22,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:27:22,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037710135] [2022-04-15 11:27:22,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037710135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:22,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:22,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:27:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091080955] [2022-04-15 11:27:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 11:27:22,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:22,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:22,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:22,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:27:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:22,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:27:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:27:22,788 INFO L87 Difference]: Start difference. First operand has 308 states, 230 states have (on average 1.5) internal successors, (345), 248 states have internal predecessors, (345), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:24,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:29,517 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-04-15 11:27:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:27:29,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 11:27:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:27:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2022-04-15 11:27:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2022-04-15 11:27:29,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 953 transitions. [2022-04-15 11:27:30,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:30,707 INFO L225 Difference]: With dead ends: 643 [2022-04-15 11:27:30,707 INFO L226 Difference]: Without dead ends: 343 [2022-04-15 11:27:30,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:27:30,718 INFO L913 BasicCegarLoop]: 335 mSDtfsCounter, 597 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:27:30,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 463 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 11:27:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-04-15 11:27:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-04-15 11:27:30,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:27:30,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:30,830 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:30,832 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:30,867 INFO L93 Difference]: Finished difference Result 343 states and 471 transitions. [2022-04-15 11:27:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 471 transitions. [2022-04-15 11:27:30,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:30,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:30,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 343 states. [2022-04-15 11:27:30,882 INFO L87 Difference]: Start difference. First operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 343 states. [2022-04-15 11:27:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:30,910 INFO L93 Difference]: Finished difference Result 343 states and 471 transitions. [2022-04-15 11:27:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 471 transitions. [2022-04-15 11:27:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:30,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:27:30,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:27:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 240 states have internal predecessors, (324), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 407 transitions. [2022-04-15 11:27:30,937 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 407 transitions. Word has length 31 [2022-04-15 11:27:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:27:30,938 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 407 transitions. [2022-04-15 11:27:30,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:30,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 407 transitions. [2022-04-15 11:27:31,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 407 transitions. [2022-04-15 11:27:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:27:31,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:31,538 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:27:31,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:27:31,538 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 186314115, now seen corresponding path program 1 times [2022-04-15 11:27:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:31,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313537721] [2022-04-15 11:27:31,539 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 186314115, now seen corresponding path program 2 times [2022-04-15 11:27:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:31,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683359690] [2022-04-15 11:27:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:31,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {2929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {2910#true} is VALID [2022-04-15 11:27:31,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:31,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2910#true} {2910#true} #1270#return; {2910#true} is VALID [2022-04-15 11:27:31,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:27:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:31,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {2930#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2910#true} is VALID [2022-04-15 11:27:31,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:31,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2910#true} {2910#true} #1216#return; {2910#true} is VALID [2022-04-15 11:27:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:27:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:27:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:32,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {2910#true} ~cond := #in~cond; {2910#true} is VALID [2022-04-15 11:27:32,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {2910#true} assume !(0 == ~cond); {2910#true} is VALID [2022-04-15 11:27:32,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:32,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2910#true} {2910#true} #1254#return; {2910#true} is VALID [2022-04-15 11:27:32,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {2931#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {2910#true} is VALID [2022-04-15 11:27:32,008 INFO L272 TraceCheckUtils]: 1: Hoare triple {2910#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {2910#true} is VALID [2022-04-15 11:27:32,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2910#true} ~cond := #in~cond; {2910#true} is VALID [2022-04-15 11:27:32,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {2910#true} assume !(0 == ~cond); {2910#true} is VALID [2022-04-15 11:27:32,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:32,009 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2910#true} {2910#true} #1254#return; {2910#true} is VALID [2022-04-15 11:27:32,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {2936#(= |DriverEntry_#res| 0)} is VALID [2022-04-15 11:27:32,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#(= |DriverEntry_#res| 0)} assume true; {2936#(= |DriverEntry_#res| 0)} is VALID [2022-04-15 11:27:32,011 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2936#(= |DriverEntry_#res| 0)} {2910#true} #1218#return; {2927#(= 0 |main_#t~ret169|)} is VALID [2022-04-15 11:27:32,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {2910#true} call ULTIMATE.init(); {2929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:27:32,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {2929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {2910#true} is VALID [2022-04-15 11:27:32,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:32,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2910#true} {2910#true} #1270#return; {2910#true} is VALID [2022-04-15 11:27:32,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {2910#true} call #t~ret213 := main(); {2910#true} is VALID [2022-04-15 11:27:32,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {2910#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {2910#true} is VALID [2022-04-15 11:27:32,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {2910#true} call _BLAST_init(); {2930#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:32,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {2930#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2910#true} is VALID [2022-04-15 11:27:32,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:32,016 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2910#true} {2910#true} #1216#return; {2910#true} is VALID [2022-04-15 11:27:32,017 INFO L272 TraceCheckUtils]: 10: Hoare triple {2910#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {2931#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:27:32,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {2931#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {2910#true} is VALID [2022-04-15 11:27:32,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {2910#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {2910#true} is VALID [2022-04-15 11:27:32,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#true} ~cond := #in~cond; {2910#true} is VALID [2022-04-15 11:27:32,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {2910#true} assume !(0 == ~cond); {2910#true} is VALID [2022-04-15 11:27:32,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {2910#true} assume true; {2910#true} is VALID [2022-04-15 11:27:32,018 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2910#true} {2910#true} #1254#return; {2910#true} is VALID [2022-04-15 11:27:32,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {2910#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {2936#(= |DriverEntry_#res| 0)} is VALID [2022-04-15 11:27:32,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {2936#(= |DriverEntry_#res| 0)} assume true; {2936#(= |DriverEntry_#res| 0)} is VALID [2022-04-15 11:27:32,019 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2936#(= |DriverEntry_#res| 0)} {2910#true} #1218#return; {2927#(= 0 |main_#t~ret169|)} is VALID [2022-04-15 11:27:32,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {2927#(= 0 |main_#t~ret169|)} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {2928#(= main_~status~5 0)} is VALID [2022-04-15 11:27:32,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {2928#(= main_~status~5 0)} assume !(~status~5 >= 0); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {2911#false} assume !(1 == ~pended~0); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#false} assume !(1 == ~pended~0); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {2911#false} assume !(~s~0 == ~UNLOADED~0); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {2911#false} assume !(-1 == ~status~5); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {2911#false} assume !(~s~0 != ~SKIP2~0); {2911#false} is VALID [2022-04-15 11:27:32,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {2911#false} assume 1 == ~pended~0; {2911#false} is VALID [2022-04-15 11:27:32,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {2911#false} assume 259 != ~status~5; {2911#false} is VALID [2022-04-15 11:27:32,022 INFO L272 TraceCheckUtils]: 29: Hoare triple {2911#false} call errorFn(); {2911#false} is VALID [2022-04-15 11:27:32,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {2911#false} assume !false; {2911#false} is VALID [2022-04-15 11:27:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:32,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683359690] [2022-04-15 11:27:32,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683359690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:32,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:32,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:27:32,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:32,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313537721] [2022-04-15 11:27:32,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313537721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:32,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:32,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:27:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33665360] [2022-04-15 11:27:32,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:32,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 11:27:32,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:32,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:32,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:32,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:27:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:27:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:27:32,065 INFO L87 Difference]: Start difference. First operand 299 states and 407 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:34,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:36,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:38,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:40,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:44,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:55,535 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2022-04-15 11:27:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:27:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 11:27:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:27:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2022-04-15 11:27:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 492 transitions. [2022-04-15 11:27:55,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 492 transitions. [2022-04-15 11:27:56,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:56,204 INFO L225 Difference]: With dead ends: 360 [2022-04-15 11:27:56,205 INFO L226 Difference]: Without dead ends: 343 [2022-04-15 11:27:56,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:27:56,206 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 600 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 221 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:27:56,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 684 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1369 Invalid, 4 Unknown, 0 Unchecked, 15.3s Time] [2022-04-15 11:27:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-04-15 11:27:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 299. [2022-04-15 11:27:56,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:27:56,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:56,251 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:56,252 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:56,264 INFO L93 Difference]: Finished difference Result 343 states and 470 transitions. [2022-04-15 11:27:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 470 transitions. [2022-04-15 11:27:56,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:56,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:56,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 343 states. [2022-04-15 11:27:56,267 INFO L87 Difference]: Start difference. First operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand 343 states. [2022-04-15 11:27:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:56,280 INFO L93 Difference]: Finished difference Result 343 states and 470 transitions. [2022-04-15 11:27:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 470 transitions. [2022-04-15 11:27:56,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:56,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:56,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:27:56,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:27:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 240 states have internal predecessors, (323), 49 states have call successors, (49), 27 states have call predecessors, (49), 25 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 11:27:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 406 transitions. [2022-04-15 11:27:56,294 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 406 transitions. Word has length 31 [2022-04-15 11:27:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:27:56,294 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 406 transitions. [2022-04-15 11:27:56,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:27:56,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 406 transitions. [2022-04-15 11:27:56,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 406 transitions. [2022-04-15 11:27:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:27:56,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:56,804 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:27:56,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:27:56,804 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1201516382, now seen corresponding path program 1 times [2022-04-15 11:27:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:56,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111545352] [2022-04-15 11:27:56,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1201516382, now seen corresponding path program 2 times [2022-04-15 11:27:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:56,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979353580] [2022-04-15 11:27:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {4979#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4948#true} {4948#true} #1270#return; {4948#true} is VALID [2022-04-15 11:27:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:27:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {4980#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4948#true} {4948#true} #1216#return; {4948#true} is VALID [2022-04-15 11:27:57,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:27:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:27:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {4948#true} ~cond := #in~cond; {4948#true} is VALID [2022-04-15 11:27:57,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {4948#true} assume !(0 == ~cond); {4948#true} is VALID [2022-04-15 11:27:57,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4948#true} {4948#true} #1254#return; {4948#true} is VALID [2022-04-15 11:27:57,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {4981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {4948#true} is VALID [2022-04-15 11:27:57,132 INFO L272 TraceCheckUtils]: 1: Hoare triple {4948#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {4948#true} is VALID [2022-04-15 11:27:57,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {4948#true} ~cond := #in~cond; {4948#true} is VALID [2022-04-15 11:27:57,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {4948#true} assume !(0 == ~cond); {4948#true} is VALID [2022-04-15 11:27:57,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,134 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4948#true} {4948#true} #1254#return; {4948#true} is VALID [2022-04-15 11:27:57,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {4948#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {4948#true} is VALID [2022-04-15 11:27:57,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,143 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4948#true} {4948#true} #1218#return; {4948#true} is VALID [2022-04-15 11:27:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:27:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:27:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {4948#true} is VALID [2022-04-15 11:27:57,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {4948#true} assume 0 == ~__BLAST_NONDET~5; {4948#true} is VALID [2022-04-15 11:27:57,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {4948#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} assume true; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,293 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} {4948#true} #1176#return; {4992#(= |KbFilter_AddDevice_#t~ret22| 0)} is VALID [2022-04-15 11:27:57,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,294 INFO L272 TraceCheckUtils]: 1: Hoare triple {4948#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:27:57,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {4948#true} is VALID [2022-04-15 11:27:57,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {4948#true} assume 0 == ~__BLAST_NONDET~5; {4948#true} is VALID [2022-04-15 11:27:57,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {4948#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} assume true; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,297 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} {4948#true} #1176#return; {4992#(= |KbFilter_AddDevice_#t~ret22| 0)} is VALID [2022-04-15 11:27:57,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {4992#(= |KbFilter_AddDevice_#t~ret22| 0)} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {4993#(= KbFilter_AddDevice_~status~0 0)} is VALID [2022-04-15 11:27:57,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {4993#(= KbFilter_AddDevice_~status~0 0)} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {4949#false} is VALID [2022-04-15 11:27:57,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {4949#false} assume true; {4949#false} is VALID [2022-04-15 11:27:57,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4949#false} {4948#true} #1220#return; {4949#false} is VALID [2022-04-15 11:27:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:27:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:57,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {4995#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4948#true} {4949#false} #1222#return; {4949#false} is VALID [2022-04-15 11:27:57,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {4948#true} call ULTIMATE.init(); {4979#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:27:57,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4948#true} {4948#true} #1270#return; {4948#true} is VALID [2022-04-15 11:27:57,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {4948#true} call #t~ret213 := main(); {4948#true} is VALID [2022-04-15 11:27:57,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {4948#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {4948#true} is VALID [2022-04-15 11:27:57,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {4948#true} call _BLAST_init(); {4980#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:57,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {4980#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,331 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4948#true} {4948#true} #1216#return; {4948#true} is VALID [2022-04-15 11:27:57,331 INFO L272 TraceCheckUtils]: 10: Hoare triple {4948#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {4981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:27:57,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {4981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {4948#true} is VALID [2022-04-15 11:27:57,332 INFO L272 TraceCheckUtils]: 12: Hoare triple {4948#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {4948#true} is VALID [2022-04-15 11:27:57,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {4948#true} ~cond := #in~cond; {4948#true} is VALID [2022-04-15 11:27:57,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {4948#true} assume !(0 == ~cond); {4948#true} is VALID [2022-04-15 11:27:57,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4948#true} {4948#true} #1254#return; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {4948#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4948#true} {4948#true} #1218#return; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {4948#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {4948#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {4948#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {4948#true} is VALID [2022-04-15 11:27:57,335 INFO L272 TraceCheckUtils]: 23: Hoare triple {4948#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:27:57,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,336 INFO L272 TraceCheckUtils]: 25: Hoare triple {4948#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:27:57,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {4986#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {4948#true} is VALID [2022-04-15 11:27:57,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {4948#true} assume 0 == ~__BLAST_NONDET~5; {4948#true} is VALID [2022-04-15 11:27:57,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {4948#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} assume true; {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} is VALID [2022-04-15 11:27:57,339 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4994#(and (<= |IoCreateDevice_#res| 0) (<= 0 |IoCreateDevice_#res|))} {4948#true} #1176#return; {4992#(= |KbFilter_AddDevice_#t~ret22| 0)} is VALID [2022-04-15 11:27:57,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {4992#(= |KbFilter_AddDevice_#t~ret22| 0)} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {4993#(= KbFilter_AddDevice_~status~0 0)} is VALID [2022-04-15 11:27:57,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {4993#(= KbFilter_AddDevice_~status~0 0)} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {4949#false} is VALID [2022-04-15 11:27:57,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {4949#false} assume true; {4949#false} is VALID [2022-04-15 11:27:57,341 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4949#false} {4948#true} #1220#return; {4949#false} is VALID [2022-04-15 11:27:57,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {4949#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {4949#false} is VALID [2022-04-15 11:27:57,341 INFO L272 TraceCheckUtils]: 36: Hoare triple {4949#false} call stub_driver_init(); {4995#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:57,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {4995#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4948#true} is VALID [2022-04-15 11:27:57,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {4948#true} assume true; {4948#true} is VALID [2022-04-15 11:27:57,342 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4948#true} {4949#false} #1222#return; {4949#false} is VALID [2022-04-15 11:27:57,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {4949#false} assume !!(~status~5 >= 0); {4949#false} is VALID [2022-04-15 11:27:57,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {4949#false} assume 0 == ~__BLAST_NONDET~0; {4949#false} is VALID [2022-04-15 11:27:57,342 INFO L272 TraceCheckUtils]: 42: Hoare triple {4949#false} call #t~ret171 := KbFilter_CreateClose(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {4949#false} is VALID [2022-04-15 11:27:57,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {4949#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~0.base, ~irpStack~0.offset;havoc ~status~1;havoc ~devExt~1.base, ~devExt~1.offset;havoc ~tmp~0;havoc ~tmp___0~0;havoc ~tmp___1~0;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~0.base, ~irpStack~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~1.base, ~devExt~1.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38 := read~int(~Irp.base, 24 + ~Irp.offset, 4);~status~1 := #t~mem38;havoc #t~mem38;~status~1 := ~myStatus~0;call #t~mem39 := read~int(~irpStack~0.base, ~irpStack~0.offset, 1); {4949#false} is VALID [2022-04-15 11:27:57,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {4949#false} assume 0 == #t~mem39 % 256;havoc #t~mem39; {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {4949#false} call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~devExt~1.base, 20 + ~devExt~1.offset, 4); {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {4949#false} assume 0 == (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;~status~1 := -1073741436; {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {4949#false} call write~int(~status~1, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~1; {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L272 TraceCheckUtils]: 48: Hoare triple {4949#false} call #t~ret44 := KbFilter_DispatchPassThrough(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {4949#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~1.base, ~irpStack~1.offset;havoc ~tmp~1;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~1.base, ~irpStack~1.offset := #t~mem45.base, #t~mem45.offset;havoc #t~mem45.base, #t~mem45.offset; {4949#false} is VALID [2022-04-15 11:27:57,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {4949#false} assume !(~s~0 == ~NP~0); {4949#false} is VALID [2022-04-15 11:27:57,344 INFO L272 TraceCheckUtils]: 51: Hoare triple {4949#false} call errorFn(); {4949#false} is VALID [2022-04-15 11:27:57,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {4949#false} assume !false; {4949#false} is VALID [2022-04-15 11:27:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:57,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979353580] [2022-04-15 11:27:57,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979353580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:57,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:57,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:27:57,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:57,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111545352] [2022-04-15 11:27:57,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111545352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:57,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:57,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:27:57,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425773241] [2022-04-15 11:27:57,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:57,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-04-15 11:27:57,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:57,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 11:27:57,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:57,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:27:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:27:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:27:57,402 INFO L87 Difference]: Start difference. First operand 299 states and 406 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 11:27:59,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:10,360 INFO L93 Difference]: Finished difference Result 599 states and 829 transitions. [2022-04-15 11:28:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:28:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-04-15 11:28:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 11:28:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 829 transitions. [2022-04-15 11:28:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 11:28:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 829 transitions. [2022-04-15 11:28:10,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 829 transitions. [2022-04-15 11:28:11,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 829 edges. 829 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:11,262 INFO L225 Difference]: With dead ends: 599 [2022-04-15 11:28:11,263 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 11:28:11,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:28:11,269 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 397 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 170 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:11,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 792 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1840 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 11:28:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 11:28:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2022-04-15 11:28:11,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:11,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-15 11:28:11,314 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-15 11:28:11,315 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-15 11:28:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:11,326 INFO L93 Difference]: Finished difference Result 348 states and 475 transitions. [2022-04-15 11:28:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2022-04-15 11:28:11,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:11,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:11,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) Second operand 348 states. [2022-04-15 11:28:11,329 INFO L87 Difference]: Start difference. First operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) Second operand 348 states. [2022-04-15 11:28:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:11,339 INFO L93 Difference]: Finished difference Result 348 states and 475 transitions. [2022-04-15 11:28:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2022-04-15 11:28:11,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:11,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:11,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:11,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 243 states have internal predecessors, (326), 49 states have call successors, (49), 27 states have call predecessors, (49), 26 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2022-04-15 11:28:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 410 transitions. [2022-04-15 11:28:11,350 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 410 transitions. Word has length 53 [2022-04-15 11:28:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:11,353 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 410 transitions. [2022-04-15 11:28:11,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 11:28:11,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 410 transitions. [2022-04-15 11:28:11,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 410 transitions. [2022-04-15 11:28:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:28:11,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:28:11,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:28:11,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:28:11,922 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:28:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:28:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1078281185, now seen corresponding path program 1 times [2022-04-15 11:28:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:11,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553672910] [2022-04-15 11:28:11,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:28:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1078281185, now seen corresponding path program 2 times [2022-04-15 11:28:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:28:11,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902444181] [2022-04-15 11:28:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:28:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:28:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:28:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {7544#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7512#true} {7512#true} #1270#return; {7512#true} is VALID [2022-04-15 11:28:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:28:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {7545#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7512#true} {7512#true} #1216#return; {7512#true} is VALID [2022-04-15 11:28:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:28:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {7512#true} ~cond := #in~cond; {7512#true} is VALID [2022-04-15 11:28:12,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {7512#true} assume !(0 == ~cond); {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7512#true} {7512#true} #1254#return; {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {7546#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L272 TraceCheckUtils]: 1: Hoare triple {7512#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {7512#true} ~cond := #in~cond; {7512#true} is VALID [2022-04-15 11:28:12,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {7512#true} assume !(0 == ~cond); {7512#true} is VALID [2022-04-15 11:28:12,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,263 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7512#true} {7512#true} #1254#return; {7512#true} is VALID [2022-04-15 11:28:12,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {7512#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {7512#true} is VALID [2022-04-15 11:28:12,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,263 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {7512#true} {7512#true} #1218#return; {7512#true} is VALID [2022-04-15 11:28:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:28:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {7512#true} is VALID [2022-04-15 11:28:12,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {7512#true} assume !(0 == ~__BLAST_NONDET~5); {7512#true} is VALID [2022-04-15 11:28:12,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {7512#true} #res := -1073741823; {7512#true} is VALID [2022-04-15 11:28:12,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,307 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7512#true} {7512#true} #1176#return; {7512#true} is VALID [2022-04-15 11:28:12,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,309 INFO L272 TraceCheckUtils]: 1: Hoare triple {7512#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:12,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {7512#true} is VALID [2022-04-15 11:28:12,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {7512#true} assume !(0 == ~__BLAST_NONDET~5); {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {7512#true} #res := -1073741823; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7512#true} {7512#true} #1176#return; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {7512#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {7512#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7512#true} {7512#true} #1220#return; {7512#true} is VALID [2022-04-15 11:28:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:28:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {7557#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {7543#(= ~s~0 ~NP~0)} assume true; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7543#(= ~s~0 ~NP~0)} {7512#true} #1222#return; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {7512#true} call ULTIMATE.init(); {7544#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:28:12,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {7544#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7512#true} {7512#true} #1270#return; {7512#true} is VALID [2022-04-15 11:28:12,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {7512#true} call #t~ret213 := main(); {7512#true} is VALID [2022-04-15 11:28:12,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {7512#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {7512#true} is VALID [2022-04-15 11:28:12,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {7512#true} call _BLAST_init(); {7545#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:12,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {7545#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,350 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7512#true} {7512#true} #1216#return; {7512#true} is VALID [2022-04-15 11:28:12,351 INFO L272 TraceCheckUtils]: 10: Hoare triple {7512#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {7546#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:28:12,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {7546#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {7512#true} is VALID [2022-04-15 11:28:12,355 INFO L272 TraceCheckUtils]: 12: Hoare triple {7512#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {7512#true} is VALID [2022-04-15 11:28:12,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {7512#true} ~cond := #in~cond; {7512#true} is VALID [2022-04-15 11:28:12,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {7512#true} assume !(0 == ~cond); {7512#true} is VALID [2022-04-15 11:28:12,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,356 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7512#true} {7512#true} #1254#return; {7512#true} is VALID [2022-04-15 11:28:12,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {7512#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {7512#true} is VALID [2022-04-15 11:28:12,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,357 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7512#true} {7512#true} #1218#return; {7512#true} is VALID [2022-04-15 11:28:12,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {7512#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {7512#true} is VALID [2022-04-15 11:28:12,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {7512#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {7512#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {7512#true} is VALID [2022-04-15 11:28:12,360 INFO L272 TraceCheckUtils]: 23: Hoare triple {7512#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:12,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {7512#true} is VALID [2022-04-15 11:28:12,365 INFO L272 TraceCheckUtils]: 25: Hoare triple {7512#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:12,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {7551#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {7512#true} is VALID [2022-04-15 11:28:12,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {7512#true} assume !(0 == ~__BLAST_NONDET~5); {7512#true} is VALID [2022-04-15 11:28:12,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {7512#true} #res := -1073741823; {7512#true} is VALID [2022-04-15 11:28:12,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {7512#true} {7512#true} #1176#return; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {7512#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {7512#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {7512#true} assume true; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7512#true} {7512#true} #1220#return; {7512#true} is VALID [2022-04-15 11:28:12,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {7512#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {7512#true} is VALID [2022-04-15 11:28:12,371 INFO L272 TraceCheckUtils]: 36: Hoare triple {7512#true} call stub_driver_init(); {7557#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:12,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {7557#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {7543#(= ~s~0 ~NP~0)} assume true; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,372 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7543#(= ~s~0 ~NP~0)} {7512#true} #1222#return; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {7543#(= ~s~0 ~NP~0)} assume !!(~status~5 >= 0); {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {7543#(= ~s~0 ~NP~0)} assume 0 == ~__BLAST_NONDET~0; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,374 INFO L272 TraceCheckUtils]: 42: Hoare triple {7543#(= ~s~0 ~NP~0)} call #t~ret171 := KbFilter_CreateClose(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {7543#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~0.base, ~irpStack~0.offset;havoc ~status~1;havoc ~devExt~1.base, ~devExt~1.offset;havoc ~tmp~0;havoc ~tmp___0~0;havoc ~tmp___1~0;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~0.base, ~irpStack~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~1.base, ~devExt~1.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38 := read~int(~Irp.base, 24 + ~Irp.offset, 4);~status~1 := #t~mem38;havoc #t~mem38;~status~1 := ~myStatus~0;call #t~mem39 := read~int(~irpStack~0.base, ~irpStack~0.offset, 1); {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {7543#(= ~s~0 ~NP~0)} assume 0 == #t~mem39 % 256;havoc #t~mem39; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {7543#(= ~s~0 ~NP~0)} call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~devExt~1.base, 20 + ~devExt~1.offset, 4); {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {7543#(= ~s~0 ~NP~0)} assume 0 == (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;~status~1 := -1073741436; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {7543#(= ~s~0 ~NP~0)} call write~int(~status~1, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~1; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,377 INFO L272 TraceCheckUtils]: 48: Hoare triple {7543#(= ~s~0 ~NP~0)} call #t~ret44 := KbFilter_DispatchPassThrough(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {7543#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~1.base, ~irpStack~1.offset;havoc ~tmp~1;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~1.base, ~irpStack~1.offset := #t~mem45.base, #t~mem45.offset;havoc #t~mem45.base, #t~mem45.offset; {7543#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:12,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {7543#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7513#false} is VALID [2022-04-15 11:28:12,378 INFO L272 TraceCheckUtils]: 51: Hoare triple {7513#false} call errorFn(); {7513#false} is VALID [2022-04-15 11:28:12,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {7513#false} assume !false; {7513#false} is VALID [2022-04-15 11:28:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:28:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:28:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902444181] [2022-04-15 11:28:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902444181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:12,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:12,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:12,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:28:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553672910] [2022-04-15 11:28:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553672910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:12,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:12,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984319489] [2022-04-15 11:28:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:28:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2022-04-15 11:28:12,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:28:12,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:28:12,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:12,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:28:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:28:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:28:12,448 INFO L87 Difference]: Start difference. First operand 303 states and 410 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:28:22,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:28,364 INFO L93 Difference]: Finished difference Result 492 states and 667 transitions. [2022-04-15 11:28:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:28:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2022-04-15 11:28:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:28:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 667 transitions. [2022-04-15 11:28:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:28:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 667 transitions. [2022-04-15 11:28:28,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 667 transitions. [2022-04-15 11:28:29,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:29,203 INFO L225 Difference]: With dead ends: 492 [2022-04-15 11:28:29,203 INFO L226 Difference]: Without dead ends: 431 [2022-04-15 11:28:29,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:28:29,204 INFO L913 BasicCegarLoop]: 366 mSDtfsCounter, 659 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 224 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:29,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 648 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1246 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-04-15 11:28:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-04-15 11:28:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 374. [2022-04-15 11:28:29,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:29,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 431 states. Second operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) [2022-04-15 11:28:29,258 INFO L74 IsIncluded]: Start isIncluded. First operand 431 states. Second operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) [2022-04-15 11:28:29,259 INFO L87 Difference]: Start difference. First operand 431 states. Second operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) [2022-04-15 11:28:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:29,272 INFO L93 Difference]: Finished difference Result 431 states and 578 transitions. [2022-04-15 11:28:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 578 transitions. [2022-04-15 11:28:29,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:29,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:29,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) Second operand 431 states. [2022-04-15 11:28:29,276 INFO L87 Difference]: Start difference. First operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) Second operand 431 states. [2022-04-15 11:28:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:29,290 INFO L93 Difference]: Finished difference Result 431 states and 578 transitions. [2022-04-15 11:28:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 578 transitions. [2022-04-15 11:28:29,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:29,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:29,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:29,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 288 states have (on average 1.3715277777777777) internal successors, (395), 292 states have internal predecessors, (395), 48 states have call successors, (48), 33 states have call predecessors, (48), 37 states have return successors, (55), 51 states have call predecessors, (55), 39 states have call successors, (55) [2022-04-15 11:28:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 498 transitions. [2022-04-15 11:28:29,305 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 498 transitions. Word has length 53 [2022-04-15 11:28:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:29,305 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 498 transitions. [2022-04-15 11:28:29,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:28:29,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 498 transitions. [2022-04-15 11:28:29,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 498 transitions. [2022-04-15 11:28:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 11:28:29,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:28:29,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:28:29,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:28:30,000 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:28:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:28:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 17478568, now seen corresponding path program 1 times [2022-04-15 11:28:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:30,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218482613] [2022-04-15 11:28:30,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:28:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 17478568, now seen corresponding path program 2 times [2022-04-15 11:28:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:28:30,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674829557] [2022-04-15 11:28:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:28:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:28:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:28:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {10209#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10172#true} {10172#true} #1270#return; {10172#true} is VALID [2022-04-15 11:28:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:28:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {10210#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10172#true} {10172#true} #1216#return; {10172#true} is VALID [2022-04-15 11:28:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:28:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {10172#true} ~cond := #in~cond; {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {10172#true} assume !(0 == ~cond); {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10172#true} {10172#true} #1254#return; {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {10172#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {10172#true} is VALID [2022-04-15 11:28:30,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {10172#true} ~cond := #in~cond; {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {10172#true} assume !(0 == ~cond); {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10172#true} {10172#true} #1254#return; {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {10172#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,292 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10172#true} {10172#true} #1218#return; {10172#true} is VALID [2022-04-15 11:28:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:28:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {10172#true} is VALID [2022-04-15 11:28:30,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {10172#true} assume !(0 == ~__BLAST_NONDET~5); {10172#true} is VALID [2022-04-15 11:28:30,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {10172#true} #res := -1073741823; {10172#true} is VALID [2022-04-15 11:28:30,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,346 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10172#true} {10172#true} #1176#return; {10172#true} is VALID [2022-04-15 11:28:30,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,347 INFO L272 TraceCheckUtils]: 1: Hoare triple {10172#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:30,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {10172#true} is VALID [2022-04-15 11:28:30,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {10172#true} assume !(0 == ~__BLAST_NONDET~5); {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {10172#true} #res := -1073741823; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10172#true} {10172#true} #1176#return; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {10172#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {10172#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10172#true} {10172#true} #1220#return; {10172#true} is VALID [2022-04-15 11:28:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:28:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {10222#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {10203#(= ~compRegistered~0 0)} assume true; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10203#(= ~compRegistered~0 0)} {10172#true} #1222#return; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:28:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:30,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {10172#true} is VALID [2022-04-15 11:28:30,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {10172#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {10172#true} is VALID [2022-04-15 11:28:30,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {10172#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {10172#true} is VALID [2022-04-15 11:28:30,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {10172#true} assume #res.base == dest.base && #res.offset == dest.offset; {10172#true} is VALID [2022-04-15 11:28:30,401 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10172#true} {10203#(= ~compRegistered~0 0)} #1186#return; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {10172#true} call ULTIMATE.init(); {10209#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:28:30,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {10209#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10172#true} {10172#true} #1270#return; {10172#true} is VALID [2022-04-15 11:28:30,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {10172#true} call #t~ret213 := main(); {10172#true} is VALID [2022-04-15 11:28:30,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {10172#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {10172#true} is VALID [2022-04-15 11:28:30,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {10172#true} call _BLAST_init(); {10210#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:30,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {10210#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,405 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10172#true} {10172#true} #1216#return; {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {10172#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:28:30,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L272 TraceCheckUtils]: 12: Hoare triple {10172#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {10172#true} ~cond := #in~cond; {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {10172#true} assume !(0 == ~cond); {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,406 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10172#true} {10172#true} #1254#return; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {10172#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10172#true} {10172#true} #1218#return; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {10172#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {10172#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {10172#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {10172#true} is VALID [2022-04-15 11:28:30,408 INFO L272 TraceCheckUtils]: 23: Hoare triple {10172#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:30,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L272 TraceCheckUtils]: 25: Hoare triple {10172#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {10216#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {10172#true} assume !(0 == ~__BLAST_NONDET~5); {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#true} #res := -1073741823; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10172#true} {10172#true} #1176#return; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {10172#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {10172#true} is VALID [2022-04-15 11:28:30,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {10172#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {10172#true} is VALID [2022-04-15 11:28:30,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {10172#true} assume true; {10172#true} is VALID [2022-04-15 11:28:30,411 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10172#true} {10172#true} #1220#return; {10172#true} is VALID [2022-04-15 11:28:30,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {10172#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {10172#true} is VALID [2022-04-15 11:28:30,412 INFO L272 TraceCheckUtils]: 36: Hoare triple {10172#true} call stub_driver_init(); {10222#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:30,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {10222#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {10203#(= ~compRegistered~0 0)} assume true; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,413 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10203#(= ~compRegistered~0 0)} {10172#true} #1222#return; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {10203#(= ~compRegistered~0 0)} assume !!(~status~5 >= 0); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {10203#(= ~compRegistered~0 0)} assume !(0 == ~__BLAST_NONDET~0); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {10203#(= ~compRegistered~0 0)} assume !(1 == ~__BLAST_NONDET~0); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {10203#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET~0); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {10203#(= ~compRegistered~0 0)} assume 3 == ~__BLAST_NONDET~0; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,416 INFO L272 TraceCheckUtils]: 45: Hoare triple {10203#(= ~compRegistered~0 0)} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {10203#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {10203#(= ~compRegistered~0 0)} assume 0 == #t~mem81 % 256;havoc #t~mem81; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {10203#(= ~compRegistered~0 0)} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,424 INFO L272 TraceCheckUtils]: 49: Hoare triple {10203#(= ~compRegistered~0 0)} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:28:30,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {10211#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {10172#true} is VALID [2022-04-15 11:28:30,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {10172#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {10172#true} is VALID [2022-04-15 11:28:30,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {10172#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {10172#true} is VALID [2022-04-15 11:28:30,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {10172#true} assume #res.base == dest.base && #res.offset == dest.offset; {10172#true} is VALID [2022-04-15 11:28:30,425 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10172#true} {10203#(= ~compRegistered~0 0)} #1186#return; {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {10203#(= ~compRegistered~0 0)} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {10203#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {10203#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:28:30,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {10203#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {10173#false} is VALID [2022-04-15 11:28:30,426 INFO L272 TraceCheckUtils]: 58: Hoare triple {10173#false} call errorFn(); {10173#false} is VALID [2022-04-15 11:28:30,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {10173#false} assume !false; {10173#false} is VALID [2022-04-15 11:28:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:28:30,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:28:30,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674829557] [2022-04-15 11:28:30,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674829557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:30,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:30,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:30,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:28:30,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218482613] [2022-04-15 11:28:30,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218482613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:30,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:30,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724192195] [2022-04-15 11:28:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:28:30,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-04-15 11:28:30,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:28:30,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 11:28:30,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:30,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:28:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:28:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:28:30,484 INFO L87 Difference]: Start difference. First operand 374 states and 498 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 11:28:35,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:37,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:39,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:43,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:46,481 INFO L93 Difference]: Finished difference Result 569 states and 751 transitions. [2022-04-15 11:28:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:28:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-04-15 11:28:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 11:28:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 618 transitions. [2022-04-15 11:28:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 11:28:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 618 transitions. [2022-04-15 11:28:46,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 618 transitions. [2022-04-15 11:28:47,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:47,298 INFO L225 Difference]: With dead ends: 569 [2022-04-15 11:28:47,298 INFO L226 Difference]: Without dead ends: 450 [2022-04-15 11:28:47,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:28:47,300 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 657 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 210 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:47,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 551 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 953 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2022-04-15 11:28:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-15 11:28:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 410. [2022-04-15 11:28:47,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:47,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:47,364 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:47,365 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:47,379 INFO L93 Difference]: Finished difference Result 450 states and 596 transitions. [2022-04-15 11:28:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 596 transitions. [2022-04-15 11:28:47,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:47,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:47,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 450 states. [2022-04-15 11:28:47,382 INFO L87 Difference]: Start difference. First operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 450 states. [2022-04-15 11:28:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:47,396 INFO L93 Difference]: Finished difference Result 450 states and 596 transitions. [2022-04-15 11:28:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 596 transitions. [2022-04-15 11:28:47,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:47,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:47,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:47,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 325 states have (on average 1.3723076923076922) internal successors, (446), 327 states have internal predecessors, (446), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 545 transitions. [2022-04-15 11:28:47,413 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 545 transitions. Word has length 60 [2022-04-15 11:28:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:47,413 INFO L478 AbstractCegarLoop]: Abstraction has 410 states and 545 transitions. [2022-04-15 11:28:47,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 11:28:47,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 410 states and 545 transitions. [2022-04-15 11:28:48,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 545 transitions. [2022-04-15 11:28:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 11:28:48,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:28:48,266 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:28:48,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:28:48,267 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:28:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:28:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash -110356200, now seen corresponding path program 1 times [2022-04-15 11:28:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:48,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317903518] [2022-04-15 11:28:48,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:28:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -110356200, now seen corresponding path program 2 times [2022-04-15 11:28:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:28:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451964593] [2022-04-15 11:28:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:28:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:28:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:28:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {13139#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {13102#true} is VALID [2022-04-15 11:28:48,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13102#true} {13102#true} #1270#return; {13102#true} is VALID [2022-04-15 11:28:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:28:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {13140#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:28:48,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} assume true; {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:28:48,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} {13102#true} #1216#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:28:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {13102#true} ~cond := #in~cond; {13102#true} is VALID [2022-04-15 11:28:48,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume !(0 == ~cond); {13102#true} is VALID [2022-04-15 11:28:48,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #1254#return; {13102#true} is VALID [2022-04-15 11:28:48,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {13142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {13102#true} is VALID [2022-04-15 11:28:48,621 INFO L272 TraceCheckUtils]: 1: Hoare triple {13102#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} ~cond := #in~cond; {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {13102#true} assume !(0 == ~cond); {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13102#true} {13102#true} #1254#return; {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {13102#true} is VALID [2022-04-15 11:28:48,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,623 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13102#true} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1218#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:28:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:28:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {13102#true} is VALID [2022-04-15 11:28:48,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume !(0 == ~__BLAST_NONDET~5); {13102#true} is VALID [2022-04-15 11:28:48,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} #res := -1073741823; {13102#true} is VALID [2022-04-15 11:28:48,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,664 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13102#true} {13102#true} #1176#return; {13102#true} is VALID [2022-04-15 11:28:48,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L272 TraceCheckUtils]: 1: Hoare triple {13102#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:48,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {13102#true} assume !(0 == ~__BLAST_NONDET~5); {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {13102#true} #res := -1073741823; {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13102#true} {13102#true} #1176#return; {13102#true} is VALID [2022-04-15 11:28:48,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {13102#true} is VALID [2022-04-15 11:28:48,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {13102#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {13102#true} is VALID [2022-04-15 11:28:48,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13102#true} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1220#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:28:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {13153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:28:48,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} assume true; {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:28:48,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1222#return; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:28:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:48,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {13102#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13102#true} is VALID [2022-04-15 11:28:48,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {13102#true} is VALID [2022-04-15 11:28:48,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} #1228#return; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13139#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:28:48,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {13139#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {13102#true} is VALID [2022-04-15 11:28:48,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #1270#return; {13102#true} is VALID [2022-04-15 11:28:48,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret213 := main(); {13102#true} is VALID [2022-04-15 11:28:48,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {13102#true} is VALID [2022-04-15 11:28:48,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {13102#true} call _BLAST_init(); {13140#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:48,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {13140#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:28:48,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} assume true; {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:28:48,762 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13141#(and (= (+ (- 1) ~NP~0) 0) (<= 4 ~SKIP2~0))} {13102#true} #1216#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,763 INFO L272 TraceCheckUtils]: 10: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {13142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:28:48,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {13142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {13102#true} is VALID [2022-04-15 11:28:48,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {13102#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {13102#true} is VALID [2022-04-15 11:28:48,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {13102#true} ~cond := #in~cond; {13102#true} is VALID [2022-04-15 11:28:48,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {13102#true} assume !(0 == ~cond); {13102#true} is VALID [2022-04-15 11:28:48,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13102#true} {13102#true} #1254#return; {13102#true} is VALID [2022-04-15 11:28:48,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {13102#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {13102#true} is VALID [2022-04-15 11:28:48,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,765 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {13102#true} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1218#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,767 INFO L272 TraceCheckUtils]: 23: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:48,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {13102#true} is VALID [2022-04-15 11:28:48,769 INFO L272 TraceCheckUtils]: 25: Hoare triple {13102#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:28:48,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {13147#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {13102#true} is VALID [2022-04-15 11:28:48,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {13102#true} assume !(0 == ~__BLAST_NONDET~5); {13102#true} is VALID [2022-04-15 11:28:48,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {13102#true} #res := -1073741823; {13102#true} is VALID [2022-04-15 11:28:48,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,770 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13102#true} {13102#true} #1176#return; {13102#true} is VALID [2022-04-15 11:28:48,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {13102#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {13102#true} is VALID [2022-04-15 11:28:48,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {13102#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {13102#true} is VALID [2022-04-15 11:28:48,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,771 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13102#true} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1220#return; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:28:48,772 INFO L272 TraceCheckUtils]: 36: Hoare triple {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} call stub_driver_init(); {13153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:48,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:28:48,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} assume true; {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:28:48,774 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13154#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} {13110#(and (not (= ~SKIP2~0 1)) (= ~NP~0 1))} #1222#return; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !!(~status~5 >= 0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(0 == ~__BLAST_NONDET~0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(1 == ~__BLAST_NONDET~0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume 2 == ~__BLAST_NONDET~0; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,776 INFO L272 TraceCheckUtils]: 44: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} call #t~ret173 := KbFilter_IoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {13102#true} is VALID [2022-04-15 11:28:48,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {13102#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {13102#true} is VALID [2022-04-15 11:28:48,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {13102#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {13102#true} is VALID [2022-04-15 11:28:48,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 11:28:48,777 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13102#true} {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} #1228#return; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume -2147483648 <= #t~ret173 && #t~ret173 <= 2147483647;~status~5 := #t~ret173;havoc #t~ret173; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume 0 != ~we_should_unload~0; {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(1 == ~pended~0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(1 == ~pended~0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(~s~0 == ~UNLOADED~0); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(-1 == ~status~5); {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} is VALID [2022-04-15 11:28:48,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {13134#(and (= ~s~0 1) (not (= ~SKIP2~0 1)))} assume !(~s~0 != ~SKIP2~0); {13103#false} is VALID [2022-04-15 11:28:48,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {13103#false} assume 1 == ~pended~0; {13103#false} is VALID [2022-04-15 11:28:48,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {13103#false} assume 259 != ~status~5; {13103#false} is VALID [2022-04-15 11:28:48,781 INFO L272 TraceCheckUtils]: 58: Hoare triple {13103#false} call errorFn(); {13103#false} is VALID [2022-04-15 11:28:48,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-15 11:28:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:28:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:28:48,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451964593] [2022-04-15 11:28:48,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451964593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:48,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:48,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:28:48,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:28:48,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317903518] [2022-04-15 11:28:48,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317903518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:48,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:48,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:28:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453011740] [2022-04-15 11:28:48,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:28:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2022-04-15 11:28:48,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:28:48,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:28:48,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:48,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:28:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:48,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:28:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:28:48,851 INFO L87 Difference]: Start difference. First operand 410 states and 545 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:28:51,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:58,395 INFO L93 Difference]: Finished difference Result 450 states and 594 transitions. [2022-04-15 11:28:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 11:28:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2022-04-15 11:28:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:28:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 542 transitions. [2022-04-15 11:28:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:28:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 542 transitions. [2022-04-15 11:28:58,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 542 transitions. [2022-04-15 11:28:59,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:59,190 INFO L225 Difference]: With dead ends: 450 [2022-04-15 11:28:59,190 INFO L226 Difference]: Without dead ends: 442 [2022-04-15 11:28:59,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:28:59,192 INFO L913 BasicCegarLoop]: 332 mSDtfsCounter, 1829 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 637 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:59,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1838 Valid, 538 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 743 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:28:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-15 11:28:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 415. [2022-04-15 11:28:59,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:59,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:59,466 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:59,467 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:59,481 INFO L93 Difference]: Finished difference Result 442 states and 585 transitions. [2022-04-15 11:28:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 585 transitions. [2022-04-15 11:28:59,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:59,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:59,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 442 states. [2022-04-15 11:28:59,484 INFO L87 Difference]: Start difference. First operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 442 states. [2022-04-15 11:28:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:59,497 INFO L93 Difference]: Finished difference Result 442 states and 585 transitions. [2022-04-15 11:28:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 585 transitions. [2022-04-15 11:28:59,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:59,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:59,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:59,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 330 states have (on average 1.3696969696969696) internal successors, (452), 332 states have internal predecessors, (452), 44 states have call successors, (44), 33 states have call predecessors, (44), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:28:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 551 transitions. [2022-04-15 11:28:59,516 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 551 transitions. Word has length 60 [2022-04-15 11:28:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:59,517 INFO L478 AbstractCegarLoop]: Abstraction has 415 states and 551 transitions. [2022-04-15 11:28:59,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:28:59,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 415 states and 551 transitions. [2022-04-15 11:29:00,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 551 transitions. [2022-04-15 11:29:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 11:29:00,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:00,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:00,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:29:00,392 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:00,392 INFO L85 PathProgramCache]: Analyzing trace with hash 400358010, now seen corresponding path program 1 times [2022-04-15 11:29:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:00,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188566375] [2022-04-15 11:29:00,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash 400358010, now seen corresponding path program 2 times [2022-04-15 11:29:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482290598] [2022-04-15 11:29:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {15833#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15801#true} {15801#true} #1270#return; {15801#true} is VALID [2022-04-15 11:29:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:29:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {15834#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15801#true} {15801#true} #1216#return; {15801#true} is VALID [2022-04-15 11:29:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:29:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {15801#true} ~cond := #in~cond; {15801#true} is VALID [2022-04-15 11:29:00,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {15801#true} assume !(0 == ~cond); {15801#true} is VALID [2022-04-15 11:29:00,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15801#true} {15801#true} #1254#return; {15801#true} is VALID [2022-04-15 11:29:00,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {15835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L272 TraceCheckUtils]: 1: Hoare triple {15801#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {15801#true} ~cond := #in~cond; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {15801#true} assume !(0 == ~cond); {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15801#true} {15801#true} #1254#return; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {15801#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,668 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15801#true} {15801#true} #1218#return; {15801#true} is VALID [2022-04-15 11:29:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:29:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {15801#true} is VALID [2022-04-15 11:29:00,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {15801#true} assume !(0 == ~__BLAST_NONDET~5); {15801#true} is VALID [2022-04-15 11:29:00,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {15801#true} #res := -1073741823; {15801#true} is VALID [2022-04-15 11:29:00,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,703 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15801#true} {15801#true} #1176#return; {15801#true} is VALID [2022-04-15 11:29:00,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L272 TraceCheckUtils]: 1: Hoare triple {15801#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {15801#true} assume !(0 == ~__BLAST_NONDET~5); {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {15801#true} #res := -1073741823; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15801#true} {15801#true} #1176#return; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {15801#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {15801#true} is VALID [2022-04-15 11:29:00,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {15801#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {15801#true} is VALID [2022-04-15 11:29:00,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15801#true} {15801#true} #1220#return; {15801#true} is VALID [2022-04-15 11:29:00,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:29:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:00,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {15846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15801#true} {15801#true} #1222#return; {15801#true} is VALID [2022-04-15 11:29:00,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {15801#true} call ULTIMATE.init(); {15833#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:29:00,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {15833#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15801#true} {15801#true} #1270#return; {15801#true} is VALID [2022-04-15 11:29:00,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {15801#true} call #t~ret213 := main(); {15801#true} is VALID [2022-04-15 11:29:00,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {15801#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {15801#true} is VALID [2022-04-15 11:29:00,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {15801#true} call _BLAST_init(); {15834#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:00,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,735 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15801#true} {15801#true} #1216#return; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L272 TraceCheckUtils]: 10: Hoare triple {15801#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {15835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {15835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L272 TraceCheckUtils]: 12: Hoare triple {15801#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {15801#true} ~cond := #in~cond; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {15801#true} assume !(0 == ~cond); {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15801#true} {15801#true} #1254#return; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {15801#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {15801#true} is VALID [2022-04-15 11:29:00,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,737 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15801#true} {15801#true} #1218#return; {15801#true} is VALID [2022-04-15 11:29:00,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {15801#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {15801#true} is VALID [2022-04-15 11:29:00,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {15801#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {15801#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {15801#true} is VALID [2022-04-15 11:29:00,738 INFO L272 TraceCheckUtils]: 23: Hoare triple {15801#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:00,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,739 INFO L272 TraceCheckUtils]: 25: Hoare triple {15801#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:00,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {15840#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {15801#true} is VALID [2022-04-15 11:29:00,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {15801#true} assume !(0 == ~__BLAST_NONDET~5); {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {15801#true} #res := -1073741823; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15801#true} {15801#true} #1176#return; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {15801#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {15801#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15801#true} {15801#true} #1220#return; {15801#true} is VALID [2022-04-15 11:29:00,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {15801#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {15801#true} is VALID [2022-04-15 11:29:00,741 INFO L272 TraceCheckUtils]: 36: Hoare triple {15801#true} call stub_driver_init(); {15846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:00,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {15846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15801#true} is VALID [2022-04-15 11:29:00,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {15801#true} assume true; {15801#true} is VALID [2022-04-15 11:29:00,741 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15801#true} {15801#true} #1222#return; {15801#true} is VALID [2022-04-15 11:29:00,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {15801#true} assume !!(~status~5 >= 0); {15801#true} is VALID [2022-04-15 11:29:00,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {15801#true} assume 0 == ~__BLAST_NONDET~0; {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L272 TraceCheckUtils]: 42: Hoare triple {15801#true} call #t~ret171 := KbFilter_CreateClose(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {15801#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~0.base, ~irpStack~0.offset;havoc ~status~1;havoc ~devExt~1.base, ~devExt~1.offset;havoc ~tmp~0;havoc ~tmp___0~0;havoc ~tmp___1~0;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~0.base, ~irpStack~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~1.base, ~devExt~1.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38 := read~int(~Irp.base, 24 + ~Irp.offset, 4);~status~1 := #t~mem38;havoc #t~mem38;~status~1 := ~myStatus~0;call #t~mem39 := read~int(~irpStack~0.base, ~irpStack~0.offset, 1); {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {15801#true} assume 0 == #t~mem39 % 256;havoc #t~mem39; {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {15801#true} call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~devExt~1.base, 20 + ~devExt~1.offset, 4); {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {15801#true} assume 0 == (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;~status~1 := -1073741436; {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {15801#true} call write~int(~status~1, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~1; {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L272 TraceCheckUtils]: 48: Hoare triple {15801#true} call #t~ret44 := KbFilter_DispatchPassThrough(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {15801#true} is VALID [2022-04-15 11:29:00,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {15801#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~1.base, ~irpStack~1.offset;havoc ~tmp~1;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~1.base, ~irpStack~1.offset := #t~mem45.base, #t~mem45.offset;havoc #t~mem45.base, #t~mem45.offset; {15801#true} is VALID [2022-04-15 11:29:00,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {15801#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} call #t~mem46 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem46) % 256 <= 127 then (1 + #t~mem46) % 256 else (1 + #t~mem46) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem46;call #t~mem47.base, #t~mem47.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem47.base, 36 + #t~mem47.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem47.base, #t~mem47.offset;call #t~mem48.base, #t~mem48.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);call #t~mem49.base, #t~mem49.offset := read~$Pointer$(#t~mem48.base, 8 + #t~mem48.offset, 4); {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,744 INFO L272 TraceCheckUtils]: 52: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} call #t~ret50 := IofCallDriver(#t~mem49.base, #t~mem49.offset, ~Irp.base, ~Irp.offset); {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET~11; {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {15832#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:29:00,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {15832#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {15802#false} is VALID [2022-04-15 11:29:00,748 INFO L272 TraceCheckUtils]: 60: Hoare triple {15802#false} call errorFn(); {15802#false} is VALID [2022-04-15 11:29:00,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {15802#false} assume !false; {15802#false} is VALID [2022-04-15 11:29:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:00,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482290598] [2022-04-15 11:29:00,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482290598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:00,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:00,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:29:00,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:00,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188566375] [2022-04-15 11:29:00,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188566375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:00,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:00,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:29:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645311011] [2022-04-15 11:29:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-15 11:29:00,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:00,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:29:00,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:00,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:29:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:29:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:29:00,811 INFO L87 Difference]: Start difference. First operand 415 states and 551 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:29:03,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:09,092 INFO L93 Difference]: Finished difference Result 433 states and 574 transitions. [2022-04-15 11:29:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:29:09,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-15 11:29:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:29:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 440 transitions. [2022-04-15 11:29:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:29:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 440 transitions. [2022-04-15 11:29:09,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 440 transitions. [2022-04-15 11:29:09,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:09,752 INFO L225 Difference]: With dead ends: 433 [2022-04-15 11:29:09,752 INFO L226 Difference]: Without dead ends: 429 [2022-04-15 11:29:09,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:29:09,753 INFO L913 BasicCegarLoop]: 297 mSDtfsCounter, 402 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:09,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 532 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 948 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:29:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-15 11:29:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 414. [2022-04-15 11:29:10,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:10,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:10,052 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:10,052 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:10,065 INFO L93 Difference]: Finished difference Result 429 states and 569 transitions. [2022-04-15 11:29:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2022-04-15 11:29:10,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:10,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:10,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 429 states. [2022-04-15 11:29:10,069 INFO L87 Difference]: Start difference. First operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 429 states. [2022-04-15 11:29:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:10,082 INFO L93 Difference]: Finished difference Result 429 states and 569 transitions. [2022-04-15 11:29:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2022-04-15 11:29:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:10,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:10,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 330 states have (on average 1.3636363636363635) internal successors, (450), 331 states have internal predecessors, (450), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 548 transitions. [2022-04-15 11:29:10,100 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 548 transitions. Word has length 62 [2022-04-15 11:29:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:29:10,100 INFO L478 AbstractCegarLoop]: Abstraction has 414 states and 548 transitions. [2022-04-15 11:29:10,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-15 11:29:10,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 414 states and 548 transitions. [2022-04-15 11:29:10,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 548 transitions. [2022-04-15 11:29:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 11:29:10,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:10,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:10,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:29:10,952 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 466089939, now seen corresponding path program 1 times [2022-04-15 11:29:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:10,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310315114] [2022-04-15 11:29:10,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 466089939, now seen corresponding path program 2 times [2022-04-15 11:29:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:10,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092142367] [2022-04-15 11:29:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {18452#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {18415#true} is VALID [2022-04-15 11:29:11,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18415#true} {18415#true} #1270#return; {18415#true} is VALID [2022-04-15 11:29:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:29:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {18453#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:29:11,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} assume true; {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:29:11,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} {18415#true} #1216#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:29:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-15 11:29:11,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-15 11:29:11,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18415#true} {18415#true} #1254#return; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {18455#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L272 TraceCheckUtils]: 1: Hoare triple {18415#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18415#true} {18415#true} #1254#return; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {18415#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {18415#true} is VALID [2022-04-15 11:29:11,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,244 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18415#true} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1218#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:29:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {18415#true} is VALID [2022-04-15 11:29:11,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {18415#true} assume !(0 == ~__BLAST_NONDET~5); {18415#true} is VALID [2022-04-15 11:29:11,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} #res := -1073741823; {18415#true} is VALID [2022-04-15 11:29:11,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,299 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18415#true} {18415#true} #1176#return; {18415#true} is VALID [2022-04-15 11:29:11,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {18415#true} is VALID [2022-04-15 11:29:11,300 INFO L272 TraceCheckUtils]: 1: Hoare triple {18415#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:11,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {18415#true} assume !(0 == ~__BLAST_NONDET~5); {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {18415#true} #res := -1073741823; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {18415#true} {18415#true} #1176#return; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {18415#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {18415#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {18415#true} is VALID [2022-04-15 11:29:11,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18415#true} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1220#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:29:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {18466#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:29:11,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} assume true; {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:29:11,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1222#return; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:29:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:11,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {18415#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {18415#true} is VALID [2022-04-15 11:29:11,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {18415#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {18415#true} is VALID [2022-04-15 11:29:11,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18415#true} {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} #1228#return; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {18415#true} call ULTIMATE.init(); {18452#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:29:11,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {18452#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {18415#true} is VALID [2022-04-15 11:29:11,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18415#true} {18415#true} #1270#return; {18415#true} is VALID [2022-04-15 11:29:11,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {18415#true} call #t~ret213 := main(); {18415#true} is VALID [2022-04-15 11:29:11,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {18415#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {18415#true} is VALID [2022-04-15 11:29:11,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {18415#true} call _BLAST_init(); {18453#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:11,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {18453#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:29:11,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} assume true; {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:29:11,387 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {18454#(and (<= 7 ~IPC~0) (= (+ (- 1) ~NP~0) 0))} {18415#true} #1216#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,388 INFO L272 TraceCheckUtils]: 10: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {18455#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {18455#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {18415#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {18415#true} ~cond := #in~cond; {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {18415#true} assume !(0 == ~cond); {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18415#true} {18415#true} #1254#return; {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {18415#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {18415#true} is VALID [2022-04-15 11:29:11,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,389 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {18415#true} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1218#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,392 INFO L272 TraceCheckUtils]: 23: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:11,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {18415#true} is VALID [2022-04-15 11:29:11,393 INFO L272 TraceCheckUtils]: 25: Hoare triple {18415#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:11,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {18460#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {18415#true} assume !(0 == ~__BLAST_NONDET~5); {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {18415#true} #res := -1073741823; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18415#true} {18415#true} #1176#return; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {18415#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {18415#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {18415#true} is VALID [2022-04-15 11:29:11,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,395 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18415#true} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1220#return; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} is VALID [2022-04-15 11:29:11,396 INFO L272 TraceCheckUtils]: 36: Hoare triple {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} call stub_driver_init(); {18466#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:11,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {18466#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:29:11,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} assume true; {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} is VALID [2022-04-15 11:29:11,398 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18467#(and (or (not (<= ~s~0 0)) (<= ~NP~0 ~s~0)) (or (<= ~s~0 ~NP~0) (<= ~s~0 1)))} {18423#(and (not (= ~IPC~0 1)) (= ~NP~0 1))} #1222#return; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !!(~status~5 >= 0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(0 == ~__BLAST_NONDET~0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(1 == ~__BLAST_NONDET~0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume 2 == ~__BLAST_NONDET~0; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,400 INFO L272 TraceCheckUtils]: 44: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} call #t~ret173 := KbFilter_IoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {18415#true} is VALID [2022-04-15 11:29:11,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {18415#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {18415#true} is VALID [2022-04-15 11:29:11,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {18415#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {18415#true} is VALID [2022-04-15 11:29:11,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {18415#true} assume true; {18415#true} is VALID [2022-04-15 11:29:11,401 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18415#true} {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} #1228#return; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume -2147483648 <= #t~ret173 && #t~ret173 <= 2147483647;~status~5 := #t~ret173;havoc #t~ret173; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume 0 != ~we_should_unload~0; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(1 == ~pended~0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(1 == ~pended~0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(~s~0 == ~UNLOADED~0); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(-1 == ~status~5); {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,403 INFO L290 TraceCheckUtils]: 55: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume ~s~0 != ~SKIP2~0; {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} is VALID [2022-04-15 11:29:11,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {18447#(and (= ~s~0 1) (not (= ~IPC~0 1)))} assume !(~s~0 != ~IPC~0); {18416#false} is VALID [2022-04-15 11:29:11,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {18416#false} assume 1 == ~pended~0; {18416#false} is VALID [2022-04-15 11:29:11,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {18416#false} assume 259 != ~status~5; {18416#false} is VALID [2022-04-15 11:29:11,404 INFO L272 TraceCheckUtils]: 59: Hoare triple {18416#false} call errorFn(); {18416#false} is VALID [2022-04-15 11:29:11,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {18416#false} assume !false; {18416#false} is VALID [2022-04-15 11:29:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092142367] [2022-04-15 11:29:11,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092142367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:11,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:11,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:29:11,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:11,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310315114] [2022-04-15 11:29:11,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310315114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:11,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:11,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:29:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758697462] [2022-04-15 11:29:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2022-04-15 11:29:11,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:11,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:11,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:11,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:29:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:29:11,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:29:11,464 INFO L87 Difference]: Start difference. First operand 414 states and 548 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:13,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:21,701 INFO L93 Difference]: Finished difference Result 448 states and 589 transitions. [2022-04-15 11:29:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 11:29:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2022-04-15 11:29:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 537 transitions. [2022-04-15 11:29:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 537 transitions. [2022-04-15 11:29:21,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 537 transitions. [2022-04-15 11:29:22,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:22,484 INFO L225 Difference]: With dead ends: 448 [2022-04-15 11:29:22,484 INFO L226 Difference]: Without dead ends: 440 [2022-04-15 11:29:22,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:29:22,485 INFO L913 BasicCegarLoop]: 333 mSDtfsCounter, 2056 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 698 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:22,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2065 Valid, 494 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 618 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 11:29:22,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-15 11:29:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 415. [2022-04-15 11:29:22,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:22,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:22,935 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:22,936 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:22,948 INFO L93 Difference]: Finished difference Result 440 states and 580 transitions. [2022-04-15 11:29:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 580 transitions. [2022-04-15 11:29:22,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:22,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:22,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 440 states. [2022-04-15 11:29:22,952 INFO L87 Difference]: Start difference. First operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) Second operand 440 states. [2022-04-15 11:29:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:22,964 INFO L93 Difference]: Finished difference Result 440 states and 580 transitions. [2022-04-15 11:29:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 580 transitions. [2022-04-15 11:29:22,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:22,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:22,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:22,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 332 states have internal predecessors, (451), 43 states have call successors, (43), 33 states have call predecessors, (43), 40 states have return successors, (55), 50 states have call predecessors, (55), 37 states have call successors, (55) [2022-04-15 11:29:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 549 transitions. [2022-04-15 11:29:22,980 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 549 transitions. Word has length 61 [2022-04-15 11:29:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:29:22,980 INFO L478 AbstractCegarLoop]: Abstraction has 415 states and 549 transitions. [2022-04-15 11:29:22,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:22,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 415 states and 549 transitions. [2022-04-15 11:29:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 549 edges. 549 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 549 transitions. [2022-04-15 11:29:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 11:29:23,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:23,780 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:23,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:29:23,780 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1325055407, now seen corresponding path program 1 times [2022-04-15 11:29:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553609263] [2022-04-15 11:29:23,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1325055407, now seen corresponding path program 2 times [2022-04-15 11:29:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564673016] [2022-04-15 11:29:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {21143#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {21106#true} is VALID [2022-04-15 11:29:23,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:23,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21106#true} {21106#true} #1270#return; {21106#true} is VALID [2022-04-15 11:29:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:29:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {21144#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:23,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume true; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:23,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21114#(not (= ~DC~0 ~NP~0))} {21106#true} #1216#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:29:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-15 11:29:24,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-15 11:29:24,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21106#true} {21106#true} #1254#return; {21106#true} is VALID [2022-04-15 11:29:24,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {21145#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {21106#true} is VALID [2022-04-15 11:29:24,030 INFO L272 TraceCheckUtils]: 1: Hoare triple {21106#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {21106#true} is VALID [2022-04-15 11:29:24,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-15 11:29:24,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-15 11:29:24,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,043 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21106#true} {21106#true} #1254#return; {21106#true} is VALID [2022-04-15 11:29:24,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {21106#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {21106#true} is VALID [2022-04-15 11:29:24,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,046 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21106#true} {21114#(not (= ~DC~0 ~NP~0))} #1218#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:29:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {21106#true} is VALID [2022-04-15 11:29:24,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#true} assume !(0 == ~__BLAST_NONDET~5); {21106#true} is VALID [2022-04-15 11:29:24,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} #res := -1073741823; {21106#true} is VALID [2022-04-15 11:29:24,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,082 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21106#true} {21106#true} #1176#return; {21106#true} is VALID [2022-04-15 11:29:24,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L272 TraceCheckUtils]: 1: Hoare triple {21106#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {21106#true} assume !(0 == ~__BLAST_NONDET~5); {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {21106#true} #res := -1073741823; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {21106#true} {21106#true} #1176#return; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {21106#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {21106#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {21106#true} is VALID [2022-04-15 11:29:24,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21106#true} {21114#(not (= ~DC~0 ~NP~0))} #1220#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:29:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {21156#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {21157#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:29:24,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {21157#(= ~s~0 ~NP~0)} assume true; {21157#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:29:24,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21157#(= ~s~0 ~NP~0)} {21114#(not (= ~DC~0 ~NP~0))} #1222#return; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:29:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:24,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {21106#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {21106#true} is VALID [2022-04-15 11:29:24,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {21106#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {21106#true} is VALID [2022-04-15 11:29:24,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21106#true} {21138#(not (= ~s~0 ~DC~0))} #1228#return; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {21106#true} call ULTIMATE.init(); {21143#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:29:24,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {21143#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {21106#true} is VALID [2022-04-15 11:29:24,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21106#true} {21106#true} #1270#return; {21106#true} is VALID [2022-04-15 11:29:24,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {21106#true} call #t~ret213 := main(); {21106#true} is VALID [2022-04-15 11:29:24,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {21106#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {21106#true} is VALID [2022-04-15 11:29:24,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {21106#true} call _BLAST_init(); {21144#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:24,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {21144#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume true; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,136 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {21114#(not (= ~DC~0 ~NP~0))} {21106#true} #1216#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,137 INFO L272 TraceCheckUtils]: 10: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {21145#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {21145#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L272 TraceCheckUtils]: 12: Hoare triple {21106#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {21106#true} ~cond := #in~cond; {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {21106#true} assume !(0 == ~cond); {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21106#true} {21106#true} #1254#return; {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {21106#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {21106#true} is VALID [2022-04-15 11:29:24,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,138 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {21106#true} {21114#(not (= ~DC~0 ~NP~0))} #1218#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,140 INFO L272 TraceCheckUtils]: 23: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:24,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {21106#true} is VALID [2022-04-15 11:29:24,141 INFO L272 TraceCheckUtils]: 25: Hoare triple {21106#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:24,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {21150#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {21106#true} is VALID [2022-04-15 11:29:24,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {21106#true} assume !(0 == ~__BLAST_NONDET~5); {21106#true} is VALID [2022-04-15 11:29:24,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {21106#true} #res := -1073741823; {21106#true} is VALID [2022-04-15 11:29:24,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,142 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21106#true} {21106#true} #1176#return; {21106#true} is VALID [2022-04-15 11:29:24,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {21106#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {21106#true} is VALID [2022-04-15 11:29:24,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {21106#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {21106#true} is VALID [2022-04-15 11:29:24,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,143 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21106#true} {21114#(not (= ~DC~0 ~NP~0))} #1220#return; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {21114#(not (= ~DC~0 ~NP~0))} is VALID [2022-04-15 11:29:24,144 INFO L272 TraceCheckUtils]: 36: Hoare triple {21114#(not (= ~DC~0 ~NP~0))} call stub_driver_init(); {21156#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:24,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {21156#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {21157#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:29:24,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {21157#(= ~s~0 ~NP~0)} assume true; {21157#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:29:24,145 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21157#(= ~s~0 ~NP~0)} {21114#(not (= ~DC~0 ~NP~0))} #1222#return; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !!(~status~5 >= 0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(0 == ~__BLAST_NONDET~0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(1 == ~__BLAST_NONDET~0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume 2 == ~__BLAST_NONDET~0; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,146 INFO L272 TraceCheckUtils]: 44: Hoare triple {21138#(not (= ~s~0 ~DC~0))} call #t~ret173 := KbFilter_IoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {21106#true} is VALID [2022-04-15 11:29:24,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {21106#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {21106#true} is VALID [2022-04-15 11:29:24,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {21106#true} assume 0 != #t~nondet17;havoc #t~nondet17;#res := 0; {21106#true} is VALID [2022-04-15 11:29:24,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {21106#true} assume true; {21106#true} is VALID [2022-04-15 11:29:24,147 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21106#true} {21138#(not (= ~s~0 ~DC~0))} #1228#return; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume -2147483648 <= #t~ret173 && #t~ret173 <= 2147483647;~status~5 := #t~ret173;havoc #t~ret173; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~5); {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume ~s~0 != ~SKIP2~0; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume ~s~0 != ~IPC~0; {21138#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:29:24,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {21138#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~DC~0); {21107#false} is VALID [2022-04-15 11:29:24,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {21107#false} assume 1 == ~pended~0; {21107#false} is VALID [2022-04-15 11:29:24,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {21107#false} assume 259 != ~status~5; {21107#false} is VALID [2022-04-15 11:29:24,158 INFO L272 TraceCheckUtils]: 60: Hoare triple {21107#false} call errorFn(); {21107#false} is VALID [2022-04-15 11:29:24,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {21107#false} assume !false; {21107#false} is VALID [2022-04-15 11:29:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564673016] [2022-04-15 11:29:24,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564673016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:24,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:24,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:29:24,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553609263] [2022-04-15 11:29:24,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553609263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:24,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:24,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:29:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783677591] [2022-04-15 11:29:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:24,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-04-15 11:29:24,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:24,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:24,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:24,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:29:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:29:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:29:24,218 INFO L87 Difference]: Start difference. First operand 415 states and 549 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:28,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:30,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:32,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:34,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:36,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:39,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:49,186 INFO L93 Difference]: Finished difference Result 442 states and 581 transitions. [2022-04-15 11:29:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 11:29:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-04-15 11:29:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 529 transitions. [2022-04-15 11:29:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 529 transitions. [2022-04-15 11:29:49,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 529 transitions. [2022-04-15 11:29:49,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:49,849 INFO L225 Difference]: With dead ends: 442 [2022-04-15 11:29:49,849 INFO L226 Difference]: Without dead ends: 389 [2022-04-15 11:29:49,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:29:49,850 INFO L913 BasicCegarLoop]: 338 mSDtfsCounter, 1382 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 446 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:49,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1390 Valid, 641 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 1050 Invalid, 4 Unknown, 0 Unchecked, 15.2s Time] [2022-04-15 11:29:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-15 11:29:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 371. [2022-04-15 11:29:50,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:50,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) [2022-04-15 11:29:50,263 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) [2022-04-15 11:29:50,264 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) [2022-04-15 11:29:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:50,273 INFO L93 Difference]: Finished difference Result 389 states and 516 transitions. [2022-04-15 11:29:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 516 transitions. [2022-04-15 11:29:50,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:50,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:50,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) Second operand 389 states. [2022-04-15 11:29:50,275 INFO L87 Difference]: Start difference. First operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) Second operand 389 states. [2022-04-15 11:29:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:50,284 INFO L93 Difference]: Finished difference Result 389 states and 516 transitions. [2022-04-15 11:29:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 516 transitions. [2022-04-15 11:29:50,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:50,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:50,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:50,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 302 states have internal predecessors, (409), 42 states have call successors, (42), 32 states have call predecessors, (42), 32 states have return successors, (42), 37 states have call predecessors, (42), 36 states have call successors, (42) [2022-04-15 11:29:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 493 transitions. [2022-04-15 11:29:50,297 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 493 transitions. Word has length 62 [2022-04-15 11:29:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:29:50,297 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 493 transitions. [2022-04-15 11:29:50,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 11:29:50,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 493 transitions. [2022-04-15 11:29:51,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 493 transitions. [2022-04-15 11:29:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 11:29:51,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:51,037 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:51,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:29:51,038 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1052170321, now seen corresponding path program 1 times [2022-04-15 11:29:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:51,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604410003] [2022-04-15 11:29:51,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1052170321, now seen corresponding path program 2 times [2022-04-15 11:29:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:51,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002748139] [2022-04-15 11:29:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {23649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23603#true} {23603#true} #1270#return; {23603#true} is VALID [2022-04-15 11:29:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:29:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {23650#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:29:51,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} assume true; {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:29:51,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} {23603#true} #1216#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:29:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {23603#true} ~cond := #in~cond; {23603#true} is VALID [2022-04-15 11:29:51,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume !(0 == ~cond); {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23603#true} {23603#true} #1254#return; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {23652#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L272 TraceCheckUtils]: 1: Hoare triple {23603#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#true} ~cond := #in~cond; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {23603#true} assume !(0 == ~cond); {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23603#true} {23603#true} #1254#return; {23603#true} is VALID [2022-04-15 11:29:51,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {23603#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {23603#true} is VALID [2022-04-15 11:29:51,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,373 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1218#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:29:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:29:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {23603#true} is VALID [2022-04-15 11:29:51,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume !(0 == ~__BLAST_NONDET~5); {23603#true} is VALID [2022-04-15 11:29:51,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#true} #res := -1073741823; {23603#true} is VALID [2022-04-15 11:29:51,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,412 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23603#true} {23603#true} #1176#return; {23603#true} is VALID [2022-04-15 11:29:51,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L272 TraceCheckUtils]: 1: Hoare triple {23603#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:51,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {23603#true} assume !(0 == ~__BLAST_NONDET~5); {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {23603#true} #res := -1073741823; {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23603#true} {23603#true} #1176#return; {23603#true} is VALID [2022-04-15 11:29:51,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {23603#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {23603#true} is VALID [2022-04-15 11:29:51,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {23603#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {23603#true} is VALID [2022-04-15 11:29:51,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1220#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:29:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {23663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1222#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 11:29:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:29:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:51,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {23670#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {23603#true} is VALID [2022-04-15 11:29:51,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {23603#true} #1248#return; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {23664#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {23603#true} is VALID [2022-04-15 11:29:51,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {23603#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {23603#true} is VALID [2022-04-15 11:29:51,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {23603#true} is VALID [2022-04-15 11:29:51,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {23603#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {23603#true} is VALID [2022-04-15 11:29:51,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {23603#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {23603#true} is VALID [2022-04-15 11:29:51,559 INFO L272 TraceCheckUtils]: 5: Hoare triple {23603#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {23670#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:29:51,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {23670#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {23603#true} is VALID [2022-04-15 11:29:51,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {23603#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,561 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {23603#true} #1248#return; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~2; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,563 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1234#return; {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {23603#true} call ULTIMATE.init(); {23649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:29:51,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {23649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23603#true} {23603#true} #1270#return; {23603#true} is VALID [2022-04-15 11:29:51,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {23603#true} call #t~ret213 := main(); {23603#true} is VALID [2022-04-15 11:29:51,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {23603#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {23603#true} is VALID [2022-04-15 11:29:51,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {23603#true} call _BLAST_init(); {23650#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:51,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {23650#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:29:51,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} assume true; {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:29:51,568 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {23651#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} {23603#true} #1216#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,569 INFO L272 TraceCheckUtils]: 10: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {23652#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:29:51,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {23652#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L272 TraceCheckUtils]: 12: Hoare triple {23603#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {23603#true} ~cond := #in~cond; {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {23603#true} assume !(0 == ~cond); {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23603#true} {23603#true} #1254#return; {23603#true} is VALID [2022-04-15 11:29:51,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {23603#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {23603#true} is VALID [2022-04-15 11:29:51,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,570 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1218#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,573 INFO L272 TraceCheckUtils]: 23: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:51,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,574 INFO L272 TraceCheckUtils]: 25: Hoare triple {23603#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {23657#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {23603#true} assume !(0 == ~__BLAST_NONDET~5); {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {23603#true} #res := -1073741823; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {23603#true} {23603#true} #1176#return; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {23603#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {23603#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {23603#true} is VALID [2022-04-15 11:29:51,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,576 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1220#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,577 INFO L272 TraceCheckUtils]: 36: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call stub_driver_init(); {23663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:51,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {23663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {23603#true} is VALID [2022-04-15 11:29:51,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {23603#true} assume true; {23603#true} is VALID [2022-04-15 11:29:51,578 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23603#true} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1222#return; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !!(~status~5 >= 0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(0 == ~__BLAST_NONDET~0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(1 == ~__BLAST_NONDET~0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(2 == ~__BLAST_NONDET~0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(3 == ~__BLAST_NONDET~0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(4 == ~__BLAST_NONDET~0); {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume 8 == ~__BLAST_NONDET~0; {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 11:29:51,582 INFO L272 TraceCheckUtils]: 47: Hoare triple {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call #t~ret176 := KbFilter_InternIoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {23664#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:51,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {23664#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {23603#true} is VALID [2022-04-15 11:29:51,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {23603#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {23603#true} is VALID [2022-04-15 11:29:51,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {23603#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {23603#true} is VALID [2022-04-15 11:29:51,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {23603#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {23603#true} is VALID [2022-04-15 11:29:51,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {23603#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {23603#true} is VALID [2022-04-15 11:29:51,583 INFO L272 TraceCheckUtils]: 53: Hoare triple {23603#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {23670#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:29:51,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {23670#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {23603#true} is VALID [2022-04-15 11:29:51,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {23603#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:29:51,584 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {23671#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {23603#true} #1248#return; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~2; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:29:51,587 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23669#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {23611#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #1234#return; {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume -2147483648 <= #t~ret176 && #t~ret176 <= 2147483647;~status~5 := #t~ret176;havoc #t~ret176; {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume 0 != ~we_should_unload~0; {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(1 == ~pended~0); {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(1 == ~pended~0); {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(~s~0 == ~UNLOADED~0); {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(-1 == ~status~5); {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 11:29:51,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {23648#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(~s~0 != ~SKIP2~0); {23604#false} is VALID [2022-04-15 11:29:51,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {23604#false} assume 1 == ~pended~0; {23604#false} is VALID [2022-04-15 11:29:51,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {23604#false} assume 259 != ~status~5; {23604#false} is VALID [2022-04-15 11:29:51,590 INFO L272 TraceCheckUtils]: 70: Hoare triple {23604#false} call errorFn(); {23604#false} is VALID [2022-04-15 11:29:51,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {23604#false} assume !false; {23604#false} is VALID [2022-04-15 11:29:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002748139] [2022-04-15 11:29:51,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002748139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:51,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:51,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:29:51,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:51,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604410003] [2022-04-15 11:29:51,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604410003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:51,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:51,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:29:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047183072] [2022-04-15 11:29:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-15 11:29:51,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:51,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:29:51,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:51,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:29:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:29:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:29:51,665 INFO L87 Difference]: Start difference. First operand 371 states and 493 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:29:53,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:03,972 INFO L93 Difference]: Finished difference Result 417 states and 550 transitions. [2022-04-15 11:30:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:30:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-15 11:30:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 457 transitions. [2022-04-15 11:30:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 457 transitions. [2022-04-15 11:30:03,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 457 transitions. [2022-04-15 11:30:04,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:04,549 INFO L225 Difference]: With dead ends: 417 [2022-04-15 11:30:04,549 INFO L226 Difference]: Without dead ends: 409 [2022-04-15 11:30:04,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-04-15 11:30:04,550 INFO L913 BasicCegarLoop]: 279 mSDtfsCounter, 992 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 323 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:04,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 581 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1506 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 11:30:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-04-15 11:30:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 386. [2022-04-15 11:30:05,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:05,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:05,006 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:05,006 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:05,017 INFO L93 Difference]: Finished difference Result 409 states and 541 transitions. [2022-04-15 11:30:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 541 transitions. [2022-04-15 11:30:05,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:05,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:05,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 409 states. [2022-04-15 11:30:05,020 INFO L87 Difference]: Start difference. First operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 409 states. [2022-04-15 11:30:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:05,031 INFO L93 Difference]: Finished difference Result 409 states and 541 transitions. [2022-04-15 11:30:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 541 transitions. [2022-04-15 11:30:05,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:05,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:05,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:05,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 314 states have internal predecessors, (425), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-04-15 11:30:05,045 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 72 [2022-04-15 11:30:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:05,045 INFO L478 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-04-15 11:30:05,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:05,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 511 transitions. [2022-04-15 11:30:05,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-04-15 11:30:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:30:05,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:05,847 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:05,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:30:05,847 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2144673722, now seen corresponding path program 1 times [2022-04-15 11:30:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:05,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1115804881] [2022-04-15 11:30:05,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2144673722, now seen corresponding path program 2 times [2022-04-15 11:30:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:05,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381416128] [2022-04-15 11:30:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:05,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {26177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26131#true} {26131#true} #1270#return; {26131#true} is VALID [2022-04-15 11:30:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:30:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {26178#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 11:30:06,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} assume true; {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 11:30:06,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} {26131#true} #1216#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:30:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26131#true} {26131#true} #1254#return; {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {26180#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L272 TraceCheckUtils]: 1: Hoare triple {26131#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-15 11:30:06,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,172 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {26131#true} {26131#true} #1254#return; {26131#true} is VALID [2022-04-15 11:30:06,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {26131#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {26131#true} is VALID [2022-04-15 11:30:06,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,173 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1218#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:30:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {26131#true} is VALID [2022-04-15 11:30:06,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume !(0 == ~__BLAST_NONDET~5); {26131#true} is VALID [2022-04-15 11:30:06,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {26131#true} #res := -1073741823; {26131#true} is VALID [2022-04-15 11:30:06,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,222 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26131#true} {26131#true} #1176#return; {26131#true} is VALID [2022-04-15 11:30:06,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L272 TraceCheckUtils]: 1: Hoare triple {26131#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {26131#true} assume !(0 == ~__BLAST_NONDET~5); {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {26131#true} #res := -1073741823; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26131#true} {26131#true} #1176#return; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {26131#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {26131#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {26131#true} is VALID [2022-04-15 11:30:06,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1220#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:30:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {26191#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1222#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 11:30:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:30:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:06,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {26198#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {26131#true} is VALID [2022-04-15 11:30:06,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {26131#true} #1248#return; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {26192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {26131#true} is VALID [2022-04-15 11:30:06,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {26131#true} is VALID [2022-04-15 11:30:06,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {26131#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {26131#true} is VALID [2022-04-15 11:30:06,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {26131#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {26131#true} is VALID [2022-04-15 11:30:06,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {26131#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {26131#true} is VALID [2022-04-15 11:30:06,373 INFO L272 TraceCheckUtils]: 5: Hoare triple {26131#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {26198#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:06,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {26198#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {26131#true} is VALID [2022-04-15 11:30:06,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {26131#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,375 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {26131#true} #1248#return; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~2; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,377 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1234#return; {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {26131#true} call ULTIMATE.init(); {26177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:06,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {26177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26131#true} {26131#true} #1270#return; {26131#true} is VALID [2022-04-15 11:30:06,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {26131#true} call #t~ret213 := main(); {26131#true} is VALID [2022-04-15 11:30:06,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {26131#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {26131#true} is VALID [2022-04-15 11:30:06,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {26131#true} call _BLAST_init(); {26178#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:06,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {26178#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 11:30:06,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} assume true; {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 11:30:06,383 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26179#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} {26131#true} #1216#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {26180#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {26180#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L272 TraceCheckUtils]: 12: Hoare triple {26131#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26131#true} {26131#true} #1254#return; {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {26131#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {26131#true} is VALID [2022-04-15 11:30:06,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,385 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1218#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,388 INFO L272 TraceCheckUtils]: 23: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:06,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,390 INFO L272 TraceCheckUtils]: 25: Hoare triple {26131#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:06,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {26185#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {26131#true} is VALID [2022-04-15 11:30:06,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {26131#true} assume !(0 == ~__BLAST_NONDET~5); {26131#true} is VALID [2022-04-15 11:30:06,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {26131#true} #res := -1073741823; {26131#true} is VALID [2022-04-15 11:30:06,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,391 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {26131#true} {26131#true} #1176#return; {26131#true} is VALID [2022-04-15 11:30:06,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {26131#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {26131#true} is VALID [2022-04-15 11:30:06,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {26131#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {26131#true} is VALID [2022-04-15 11:30:06,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,392 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1220#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,393 INFO L272 TraceCheckUtils]: 36: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call stub_driver_init(); {26191#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:06,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {26191#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {26131#true} is VALID [2022-04-15 11:30:06,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-15 11:30:06,393 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26131#true} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1222#return; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !!(~status~5 >= 0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(0 == ~__BLAST_NONDET~0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(1 == ~__BLAST_NONDET~0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(2 == ~__BLAST_NONDET~0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(3 == ~__BLAST_NONDET~0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(4 == ~__BLAST_NONDET~0); {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume 8 == ~__BLAST_NONDET~0; {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,397 INFO L272 TraceCheckUtils]: 47: Hoare triple {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call #t~ret176 := KbFilter_InternIoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {26192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:06,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {26192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {26131#true} is VALID [2022-04-15 11:30:06,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {26131#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {26131#true} is VALID [2022-04-15 11:30:06,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {26131#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {26131#true} is VALID [2022-04-15 11:30:06,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {26131#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {26131#true} is VALID [2022-04-15 11:30:06,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {26131#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {26131#true} is VALID [2022-04-15 11:30:06,399 INFO L272 TraceCheckUtils]: 53: Hoare triple {26131#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {26198#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:06,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {26198#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {26131#true} is VALID [2022-04-15 11:30:06,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {26131#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 11:30:06,400 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {26199#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {26131#true} #1248#return; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~2; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 11:30:06,403 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {26197#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {26139#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #1234#return; {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume -2147483648 <= #t~ret176 && #t~ret176 <= 2147483647;~status~5 := #t~ret176;havoc #t~ret176; {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume 0 != ~we_should_unload~0; {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(1 == ~pended~0); {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(1 == ~pended~0); {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(~s~0 == ~UNLOADED~0); {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(-1 == ~status~5); {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume ~s~0 != ~SKIP2~0; {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 11:30:06,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {26176#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(~s~0 != ~IPC~0); {26132#false} is VALID [2022-04-15 11:30:06,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {26132#false} assume 1 == ~pended~0; {26132#false} is VALID [2022-04-15 11:30:06,406 INFO L290 TraceCheckUtils]: 70: Hoare triple {26132#false} assume 259 != ~status~5; {26132#false} is VALID [2022-04-15 11:30:06,406 INFO L272 TraceCheckUtils]: 71: Hoare triple {26132#false} call errorFn(); {26132#false} is VALID [2022-04-15 11:30:06,406 INFO L290 TraceCheckUtils]: 72: Hoare triple {26132#false} assume !false; {26132#false} is VALID [2022-04-15 11:30:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381416128] [2022-04-15 11:30:06,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381416128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:06,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:30:06,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1115804881] [2022-04-15 11:30:06,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1115804881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:06,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:06,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:30:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572547367] [2022-04-15 11:30:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:06,408 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-04-15 11:30:06,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:06,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:06,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:06,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:30:06,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:30:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:30:06,481 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:08,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:12,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:18,135 INFO L93 Difference]: Finished difference Result 417 states and 549 transitions. [2022-04-15 11:30:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:30:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-04-15 11:30:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 456 transitions. [2022-04-15 11:30:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 456 transitions. [2022-04-15 11:30:18,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 456 transitions. [2022-04-15 11:30:18,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:18,710 INFO L225 Difference]: With dead ends: 417 [2022-04-15 11:30:18,710 INFO L226 Difference]: Without dead ends: 409 [2022-04-15 11:30:18,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-04-15 11:30:18,711 INFO L913 BasicCegarLoop]: 279 mSDtfsCounter, 894 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 291 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:18,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [906 Valid, 549 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1148 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:30:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-04-15 11:30:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 387. [2022-04-15 11:30:19,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:19,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:19,134 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:19,134 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:19,143 INFO L93 Difference]: Finished difference Result 409 states and 540 transitions. [2022-04-15 11:30:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 540 transitions. [2022-04-15 11:30:19,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:19,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:19,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 409 states. [2022-04-15 11:30:19,145 INFO L87 Difference]: Start difference. First operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 409 states. [2022-04-15 11:30:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:19,155 INFO L93 Difference]: Finished difference Result 409 states and 540 transitions. [2022-04-15 11:30:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 540 transitions. [2022-04-15 11:30:19,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:19,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:19,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:19,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 310 states have (on average 1.3741935483870968) internal successors, (426), 315 states have internal predecessors, (426), 42 states have call successors, (42), 32 states have call predecessors, (42), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 512 transitions. [2022-04-15 11:30:19,168 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 512 transitions. Word has length 73 [2022-04-15 11:30:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:19,168 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 512 transitions. [2022-04-15 11:30:19,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:19,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 387 states and 512 transitions. [2022-04-15 11:30:19,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 512 transitions. [2022-04-15 11:30:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:30:19,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:19,950 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:19,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:30:19,951 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1821545128, now seen corresponding path program 1 times [2022-04-15 11:30:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:19,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045681605] [2022-04-15 11:30:19,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1821545128, now seen corresponding path program 2 times [2022-04-15 11:30:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974745303] [2022-04-15 11:30:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {28706#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28661#true} {28661#true} #1270#return; {28661#true} is VALID [2022-04-15 11:30:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:30:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {28707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28661#true} {28661#true} #1216#return; {28661#true} is VALID [2022-04-15 11:30:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:30:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {28661#true} ~cond := #in~cond; {28661#true} is VALID [2022-04-15 11:30:20,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume !(0 == ~cond); {28661#true} is VALID [2022-04-15 11:30:20,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28661#true} {28661#true} #1254#return; {28661#true} is VALID [2022-04-15 11:30:20,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {28708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L272 TraceCheckUtils]: 1: Hoare triple {28661#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} ~cond := #in~cond; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {28661#true} assume !(0 == ~cond); {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28661#true} {28661#true} #1254#return; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {28661#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,186 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28661#true} {28661#true} #1218#return; {28661#true} is VALID [2022-04-15 11:30:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:30:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {28661#true} is VALID [2022-04-15 11:30:20,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume !(0 == ~__BLAST_NONDET~5); {28661#true} is VALID [2022-04-15 11:30:20,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} #res := -1073741823; {28661#true} is VALID [2022-04-15 11:30:20,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,217 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28661#true} {28661#true} #1176#return; {28661#true} is VALID [2022-04-15 11:30:20,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,218 INFO L272 TraceCheckUtils]: 1: Hoare triple {28661#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {28661#true} assume !(0 == ~__BLAST_NONDET~5); {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {28661#true} #res := -1073741823; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28661#true} {28661#true} #1176#return; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {28661#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {28661#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {28661#true} is VALID [2022-04-15 11:30:20,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,220 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28661#true} {28661#true} #1220#return; {28661#true} is VALID [2022-04-15 11:30:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:30:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {28719#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28661#true} {28661#true} #1222#return; {28661#true} is VALID [2022-04-15 11:30:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 11:30:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:30:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:20,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {28725#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {28661#true} is VALID [2022-04-15 11:30:20,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {28661#true} is VALID [2022-04-15 11:30:20,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28661#true} {28661#true} #1248#return; {28661#true} is VALID [2022-04-15 11:30:20,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {28720#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {28661#true} is VALID [2022-04-15 11:30:20,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {28661#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {28661#true} is VALID [2022-04-15 11:30:20,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {28661#true} is VALID [2022-04-15 11:30:20,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {28661#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {28661#true} is VALID [2022-04-15 11:30:20,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {28661#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L272 TraceCheckUtils]: 5: Hoare triple {28661#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {28725#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:20,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {28725#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {28661#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {28661#true} {28661#true} #1248#return; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {28661#true} #res := ~status~2; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,298 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {28661#true} {28661#true} #1234#return; {28661#true} is VALID [2022-04-15 11:30:20,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {28661#true} call ULTIMATE.init(); {28706#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:20,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {28706#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28661#true} {28661#true} #1270#return; {28661#true} is VALID [2022-04-15 11:30:20,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {28661#true} call #t~ret213 := main(); {28661#true} is VALID [2022-04-15 11:30:20,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {28661#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {28661#true} is VALID [2022-04-15 11:30:20,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {28661#true} call _BLAST_init(); {28707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:20,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {28707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,302 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {28661#true} {28661#true} #1216#return; {28661#true} is VALID [2022-04-15 11:30:20,302 INFO L272 TraceCheckUtils]: 10: Hoare triple {28661#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {28708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:30:20,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {28708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {28661#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {28661#true} ~cond := #in~cond; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {28661#true} assume !(0 == ~cond); {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28661#true} {28661#true} #1254#return; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {28661#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28661#true} {28661#true} #1218#return; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {28661#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {28661#true} is VALID [2022-04-15 11:30:20,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {28661#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {28661#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {28661#true} is VALID [2022-04-15 11:30:20,304 INFO L272 TraceCheckUtils]: 23: Hoare triple {28661#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:20,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L272 TraceCheckUtils]: 25: Hoare triple {28661#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {28713#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {28661#true} assume !(0 == ~__BLAST_NONDET~5); {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {28661#true} #res := -1073741823; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {28661#true} {28661#true} #1176#return; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {28661#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {28661#true} is VALID [2022-04-15 11:30:20,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {28661#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {28661#true} is VALID [2022-04-15 11:30:20,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,307 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28661#true} {28661#true} #1220#return; {28661#true} is VALID [2022-04-15 11:30:20,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {28661#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {28661#true} is VALID [2022-04-15 11:30:20,307 INFO L272 TraceCheckUtils]: 36: Hoare triple {28661#true} call stub_driver_init(); {28719#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:20,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {28719#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28661#true} {28661#true} #1222#return; {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {28661#true} assume !!(~status~5 >= 0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {28661#true} assume !(0 == ~__BLAST_NONDET~0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {28661#true} assume !(1 == ~__BLAST_NONDET~0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {28661#true} assume !(2 == ~__BLAST_NONDET~0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {28661#true} assume !(3 == ~__BLAST_NONDET~0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {28661#true} assume !(4 == ~__BLAST_NONDET~0); {28661#true} is VALID [2022-04-15 11:30:20,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {28661#true} assume 8 == ~__BLAST_NONDET~0; {28661#true} is VALID [2022-04-15 11:30:20,309 INFO L272 TraceCheckUtils]: 47: Hoare triple {28661#true} call #t~ret176 := KbFilter_InternIoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {28720#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:20,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {28720#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {28661#true} is VALID [2022-04-15 11:30:20,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {28661#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {28661#true} is VALID [2022-04-15 11:30:20,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {28661#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {28661#true} is VALID [2022-04-15 11:30:20,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {28661#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {28661#true} is VALID [2022-04-15 11:30:20,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {28661#true} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {28661#true} is VALID [2022-04-15 11:30:20,310 INFO L272 TraceCheckUtils]: 53: Hoare triple {28661#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {28725#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {28725#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {28661#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {28661#true} {28661#true} #1248#return; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {28661#true} #res := ~status~2; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {28661#true} assume true; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28661#true} {28661#true} #1234#return; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {28661#true} assume -2147483648 <= #t~ret176 && #t~ret176 <= 2147483647;~status~5 := #t~ret176;havoc #t~ret176; {28661#true} is VALID [2022-04-15 11:30:20,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {28661#true} assume 0 != ~we_should_unload~0; {28661#true} is VALID [2022-04-15 11:30:20,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {28661#true} assume !(1 == ~pended~0); {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,312 INFO L290 TraceCheckUtils]: 64: Hoare triple {28705#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,312 INFO L290 TraceCheckUtils]: 65: Hoare triple {28705#(not (= ~pended~0 1))} assume !(~s~0 == ~UNLOADED~0); {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {28705#(not (= ~pended~0 1))} assume !(-1 == ~status~5); {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {28705#(not (= ~pended~0 1))} assume ~s~0 != ~SKIP2~0; {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {28705#(not (= ~pended~0 1))} assume ~s~0 != ~IPC~0; {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {28705#(not (= ~pended~0 1))} assume !(~s~0 != ~DC~0); {28705#(not (= ~pended~0 1))} is VALID [2022-04-15 11:30:20,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {28705#(not (= ~pended~0 1))} assume 1 == ~pended~0; {28662#false} is VALID [2022-04-15 11:30:20,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {28662#false} assume 259 != ~status~5; {28662#false} is VALID [2022-04-15 11:30:20,314 INFO L272 TraceCheckUtils]: 72: Hoare triple {28662#false} call errorFn(); {28662#false} is VALID [2022-04-15 11:30:20,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {28662#false} assume !false; {28662#false} is VALID [2022-04-15 11:30:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:20,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974745303] [2022-04-15 11:30:20,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974745303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:20,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:20,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:30:20,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:20,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045681605] [2022-04-15 11:30:20,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045681605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:20,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:20,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:30:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456744770] [2022-04-15 11:30:20,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2022-04-15 11:30:20,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:20,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:30:20,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:20,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:30:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:30:20,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:30:20,386 INFO L87 Difference]: Start difference. First operand 387 states and 512 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:30:22,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:29,117 INFO L93 Difference]: Finished difference Result 419 states and 554 transitions. [2022-04-15 11:30:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:30:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2022-04-15 11:30:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:30:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2022-04-15 11:30:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:30:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2022-04-15 11:30:29,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 436 transitions. [2022-04-15 11:30:29,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:29,667 INFO L225 Difference]: With dead ends: 419 [2022-04-15 11:30:29,668 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:30:29,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:30:29,669 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 1118 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 364 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:29,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 501 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 784 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:30:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:30:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 381. [2022-04-15 11:30:30,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:30,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:30,066 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:30,067 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:30,073 INFO L93 Difference]: Finished difference Result 396 states and 522 transitions. [2022-04-15 11:30:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 522 transitions. [2022-04-15 11:30:30,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:30,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:30,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 396 states. [2022-04-15 11:30:30,076 INFO L87 Difference]: Start difference. First operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) Second operand 396 states. [2022-04-15 11:30:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:30,085 INFO L93 Difference]: Finished difference Result 396 states and 522 transitions. [2022-04-15 11:30:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 522 transitions. [2022-04-15 11:30:30,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:30,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:30,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:30,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 305 states have (on average 1.3639344262295081) internal successors, (416), 309 states have internal predecessors, (416), 41 states have call successors, (41), 32 states have call predecessors, (41), 34 states have return successors, (44), 39 states have call predecessors, (44), 36 states have call successors, (44) [2022-04-15 11:30:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 501 transitions. [2022-04-15 11:30:30,098 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 501 transitions. Word has length 74 [2022-04-15 11:30:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:30,098 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 501 transitions. [2022-04-15 11:30:30,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:30:30,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 501 transitions. [2022-04-15 11:30:30,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 501 transitions. [2022-04-15 11:30:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:30:30,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:30,900 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:30,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:30:30,900 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 937494245, now seen corresponding path program 1 times [2022-04-15 11:30:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:30,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121215454] [2022-04-15 11:30:30,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash 937494245, now seen corresponding path program 2 times [2022-04-15 11:30:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:30,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499344089] [2022-04-15 11:30:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {31188#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31143#true} {31143#true} #1270#return; {31143#true} is VALID [2022-04-15 11:30:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:30:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {31189#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31143#true} {31143#true} #1216#return; {31143#true} is VALID [2022-04-15 11:30:31,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:30:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {31143#true} ~cond := #in~cond; {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume !(0 == ~cond); {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31143#true} {31143#true} #1254#return; {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L272 TraceCheckUtils]: 1: Hoare triple {31143#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {31143#true} ~cond := #in~cond; {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {31143#true} assume !(0 == ~cond); {31143#true} is VALID [2022-04-15 11:30:31,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,174 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31143#true} {31143#true} #1254#return; {31143#true} is VALID [2022-04-15 11:30:31,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {31143#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {31143#true} is VALID [2022-04-15 11:30:31,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,174 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {31143#true} {31143#true} #1218#return; {31143#true} is VALID [2022-04-15 11:30:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:30:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {31143#true} is VALID [2022-04-15 11:30:31,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume !(0 == ~__BLAST_NONDET~5); {31143#true} is VALID [2022-04-15 11:30:31,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {31143#true} #res := -1073741823; {31143#true} is VALID [2022-04-15 11:30:31,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,209 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31143#true} {31143#true} #1176#return; {31143#true} is VALID [2022-04-15 11:30:31,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,210 INFO L272 TraceCheckUtils]: 1: Hoare triple {31143#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:31,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {31143#true} is VALID [2022-04-15 11:30:31,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {31143#true} assume !(0 == ~__BLAST_NONDET~5); {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {31143#true} #res := -1073741823; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31143#true} {31143#true} #1176#return; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {31143#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {31143#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31143#true} {31143#true} #1220#return; {31143#true} is VALID [2022-04-15 11:30:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:30:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {31201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31143#true} {31143#true} #1222#return; {31143#true} is VALID [2022-04-15 11:30:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:30:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {31143#true} is VALID [2022-04-15 11:30:31,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {31143#true} is VALID [2022-04-15 11:30:31,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {31143#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {31143#true} is VALID [2022-04-15 11:30:31,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {31143#true} assume #res.base == dest.base && #res.offset == dest.offset; {31143#true} is VALID [2022-04-15 11:30:31,256 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31143#true} {31143#true} #1186#return; {31143#true} is VALID [2022-04-15 11:30:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:30:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:31,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {31202#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {31143#true} is VALID [2022-04-15 11:30:31,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {31143#true} assume !(0 != ~compRegistered~0); {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {31203#(<= ~compRegistered~0 0)} assume 0 == ~__BLAST_NONDET~11; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {31203#(<= ~compRegistered~0 0)} ~returnVal2~0 := 0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {31203#(<= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {31203#(<= ~compRegistered~0 0)} #res := ~returnVal2~0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {31203#(<= ~compRegistered~0 0)} assume true; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31203#(<= ~compRegistered~0 0)} {31179#(= ~compRegistered~0 1)} #1192#return; {31144#false} is VALID [2022-04-15 11:30:31,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {31143#true} call ULTIMATE.init(); {31188#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:31,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {31188#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31143#true} {31143#true} #1270#return; {31143#true} is VALID [2022-04-15 11:30:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {31143#true} call #t~ret213 := main(); {31143#true} is VALID [2022-04-15 11:30:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {31143#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {31143#true} is VALID [2022-04-15 11:30:31,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {31143#true} call _BLAST_init(); {31189#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:31,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {31189#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,297 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {31143#true} {31143#true} #1216#return; {31143#true} is VALID [2022-04-15 11:30:31,297 INFO L272 TraceCheckUtils]: 10: Hoare triple {31143#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {31143#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {31143#true} ~cond := #in~cond; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {31143#true} assume !(0 == ~cond); {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31143#true} {31143#true} #1254#return; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {31143#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,298 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {31143#true} {31143#true} #1218#return; {31143#true} is VALID [2022-04-15 11:30:31,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {31143#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {31143#true} is VALID [2022-04-15 11:30:31,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {31143#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {31143#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {31143#true} is VALID [2022-04-15 11:30:31,300 INFO L272 TraceCheckUtils]: 23: Hoare triple {31143#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:31,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,301 INFO L272 TraceCheckUtils]: 25: Hoare triple {31143#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:31,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {31195#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {31143#true} assume !(0 == ~__BLAST_NONDET~5); {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {31143#true} #res := -1073741823; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {31143#true} {31143#true} #1176#return; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {31143#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {31143#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {31143#true} {31143#true} #1220#return; {31143#true} is VALID [2022-04-15 11:30:31,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {31143#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {31143#true} is VALID [2022-04-15 11:30:31,303 INFO L272 TraceCheckUtils]: 36: Hoare triple {31143#true} call stub_driver_init(); {31201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:31,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {31201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {31143#true} is VALID [2022-04-15 11:30:31,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {31143#true} assume true; {31143#true} is VALID [2022-04-15 11:30:31,303 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31143#true} {31143#true} #1222#return; {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {31143#true} assume !!(~status~5 >= 0); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {31143#true} assume !(0 == ~__BLAST_NONDET~0); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {31143#true} assume !(1 == ~__BLAST_NONDET~0); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {31143#true} assume !(2 == ~__BLAST_NONDET~0); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {31143#true} assume 3 == ~__BLAST_NONDET~0; {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L272 TraceCheckUtils]: 45: Hoare triple {31143#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {31143#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {31143#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {31143#true} is VALID [2022-04-15 11:30:31,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {31143#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {31143#true} is VALID [2022-04-15 11:30:31,305 INFO L272 TraceCheckUtils]: 49: Hoare triple {31143#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:30:31,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {31190#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {31143#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {31143#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {31143#true} assume #res.base == dest.base && #res.offset == dest.offset; {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31143#true} {31143#true} #1186#return; {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {31143#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {31143#true} assume !(~s~0 != ~NP~0); {31143#true} is VALID [2022-04-15 11:30:31,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {31143#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {31179#(= ~compRegistered~0 1)} is VALID [2022-04-15 11:30:31,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {31179#(= ~compRegistered~0 1)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {31179#(= ~compRegistered~0 1)} is VALID [2022-04-15 11:30:31,308 INFO L272 TraceCheckUtils]: 59: Hoare triple {31179#(= ~compRegistered~0 1)} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {31202#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:31,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {31202#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {31143#true} is VALID [2022-04-15 11:30:31,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {31143#true} assume !(0 != ~compRegistered~0); {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,309 INFO L290 TraceCheckUtils]: 62: Hoare triple {31203#(<= ~compRegistered~0 0)} assume 0 == ~__BLAST_NONDET~11; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {31203#(<= ~compRegistered~0 0)} ~returnVal2~0 := 0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {31203#(<= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {31203#(<= ~compRegistered~0 0)} #res := ~returnVal2~0; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {31203#(<= ~compRegistered~0 0)} assume true; {31203#(<= ~compRegistered~0 0)} is VALID [2022-04-15 11:30:31,311 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {31203#(<= ~compRegistered~0 0)} {31179#(= ~compRegistered~0 1)} #1192#return; {31144#false} is VALID [2022-04-15 11:30:31,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {31144#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {31144#false} is VALID [2022-04-15 11:30:31,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {31144#false} assume !(259 == ~status~3); {31144#false} is VALID [2022-04-15 11:30:31,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {31144#false} assume !(~status~3 >= 0); {31144#false} is VALID [2022-04-15 11:30:31,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {31144#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {31144#false} is VALID [2022-04-15 11:30:31,311 INFO L272 TraceCheckUtils]: 72: Hoare triple {31144#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {31144#false} is VALID [2022-04-15 11:30:31,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {31144#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {31144#false} is VALID [2022-04-15 11:30:31,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {31144#false} assume !(~s~0 == ~NP~0); {31144#false} is VALID [2022-04-15 11:30:31,312 INFO L272 TraceCheckUtils]: 75: Hoare triple {31144#false} call errorFn(); {31144#false} is VALID [2022-04-15 11:30:31,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {31144#false} assume !false; {31144#false} is VALID [2022-04-15 11:30:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:31,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499344089] [2022-04-15 11:30:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499344089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:31,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:31,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:30:31,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:31,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121215454] [2022-04-15 11:30:31,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121215454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:31,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:31,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:30:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094186590] [2022-04-15 11:30:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:31,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2022-04-15 11:30:31,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:31,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:31,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:31,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:30:31,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:30:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:30:31,397 INFO L87 Difference]: Start difference. First operand 381 states and 501 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:33,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:38,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:43,730 INFO L93 Difference]: Finished difference Result 437 states and 561 transitions. [2022-04-15 11:30:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:30:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2022-04-15 11:30:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 493 transitions. [2022-04-15 11:30:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 493 transitions. [2022-04-15 11:30:43,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 493 transitions. [2022-04-15 11:30:44,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:44,324 INFO L225 Difference]: With dead ends: 437 [2022-04-15 11:30:44,324 INFO L226 Difference]: Without dead ends: 374 [2022-04-15 11:30:44,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:30:44,325 INFO L913 BasicCegarLoop]: 313 mSDtfsCounter, 1056 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 325 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:44,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 602 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 836 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-04-15 11:30:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-04-15 11:30:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 345. [2022-04-15 11:30:44,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:44,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:44,793 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:44,793 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:44,799 INFO L93 Difference]: Finished difference Result 374 states and 482 transitions. [2022-04-15 11:30:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2022-04-15 11:30:44,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:44,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:44,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) Second operand 374 states. [2022-04-15 11:30:44,801 INFO L87 Difference]: Start difference. First operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) Second operand 374 states. [2022-04-15 11:30:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:44,809 INFO L93 Difference]: Finished difference Result 374 states and 482 transitions. [2022-04-15 11:30:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2022-04-15 11:30:44,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:44,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:44,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:44,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 278 states have internal predecessors, (370), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 447 transitions. [2022-04-15 11:30:44,828 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 447 transitions. Word has length 77 [2022-04-15 11:30:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:44,828 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 447 transitions. [2022-04-15 11:30:44,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:44,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 345 states and 447 transitions. [2022-04-15 11:30:45,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 447 transitions. [2022-04-15 11:30:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:30:45,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:45,557 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:45,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:30:45,557 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 641442499, now seen corresponding path program 1 times [2022-04-15 11:30:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1381251207] [2022-04-15 11:30:45,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 641442499, now seen corresponding path program 2 times [2022-04-15 11:30:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934588973] [2022-04-15 11:30:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {33589#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33543#true} {33543#true} #1270#return; {33543#true} is VALID [2022-04-15 11:30:45,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:30:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {33590#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33543#true} {33543#true} #1216#return; {33543#true} is VALID [2022-04-15 11:30:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:30:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {33543#true} ~cond := #in~cond; {33543#true} is VALID [2022-04-15 11:30:45,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume !(0 == ~cond); {33543#true} is VALID [2022-04-15 11:30:45,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #1254#return; {33543#true} is VALID [2022-04-15 11:30:45,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {33591#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {33543#true} is VALID [2022-04-15 11:30:45,789 INFO L272 TraceCheckUtils]: 1: Hoare triple {33543#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} ~cond := #in~cond; {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {33543#true} assume !(0 == ~cond); {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {33543#true} {33543#true} #1254#return; {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {33543#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,790 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {33543#true} {33543#true} #1218#return; {33543#true} is VALID [2022-04-15 11:30:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:30:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:30:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {33543#true} is VALID [2022-04-15 11:30:45,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume !(0 == ~__BLAST_NONDET~5); {33543#true} is VALID [2022-04-15 11:30:45,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} #res := -1073741823; {33543#true} is VALID [2022-04-15 11:30:45,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,821 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33543#true} {33543#true} #1176#return; {33543#true} is VALID [2022-04-15 11:30:45,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L272 TraceCheckUtils]: 1: Hoare triple {33543#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {33543#true} assume !(0 == ~__BLAST_NONDET~5); {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {33543#true} #res := -1073741823; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33543#true} {33543#true} #1176#return; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {33543#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {33543#true} is VALID [2022-04-15 11:30:45,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {33543#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {33543#true} is VALID [2022-04-15 11:30:45,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33543#true} {33543#true} #1220#return; {33543#true} is VALID [2022-04-15 11:30:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:30:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {33602#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33543#true} {33543#true} #1222#return; {33543#true} is VALID [2022-04-15 11:30:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 11:30:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:30:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:45,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {33610#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {33543#true} is VALID [2022-04-15 11:30:45,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {33543#true} is VALID [2022-04-15 11:30:45,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} #1248#return; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {33603#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {33543#true} is VALID [2022-04-15 11:30:45,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {33543#true} is VALID [2022-04-15 11:30:45,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {33543#true} is VALID [2022-04-15 11:30:45,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {33543#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,924 INFO L272 TraceCheckUtils]: 5: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {33610#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:45,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {33610#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {33543#true} is VALID [2022-04-15 11:30:45,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {33543#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {33543#true} is VALID [2022-04-15 11:30:45,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,925 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {33543#true} {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} #1248#return; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} #res := ~status~2; {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} is VALID [2022-04-15 11:30:45,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} assume true; {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} is VALID [2022-04-15 11:30:45,927 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} {33543#true} #1234#return; {33587#(not (= 259 |main_#t~ret176|))} is VALID [2022-04-15 11:30:45,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33589#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:45,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {33589#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #1270#return; {33543#true} is VALID [2022-04-15 11:30:45,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret213 := main(); {33543#true} is VALID [2022-04-15 11:30:45,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {33543#true} is VALID [2022-04-15 11:30:45,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {33543#true} call _BLAST_init(); {33590#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:45,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {33590#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,930 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {33543#true} {33543#true} #1216#return; {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L272 TraceCheckUtils]: 10: Hoare triple {33543#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {33591#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:30:45,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {33591#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {33543#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {33543#true} ~cond := #in~cond; {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {33543#true} assume !(0 == ~cond); {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33543#true} {33543#true} #1254#return; {33543#true} is VALID [2022-04-15 11:30:45,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {33543#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {33543#true} is VALID [2022-04-15 11:30:45,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,932 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {33543#true} {33543#true} #1218#return; {33543#true} is VALID [2022-04-15 11:30:45,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {33543#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {33543#true} is VALID [2022-04-15 11:30:45,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {33543#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {33543#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {33543#true} is VALID [2022-04-15 11:30:45,933 INFO L272 TraceCheckUtils]: 23: Hoare triple {33543#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:45,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,934 INFO L272 TraceCheckUtils]: 25: Hoare triple {33543#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:30:45,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {33596#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {33543#true} is VALID [2022-04-15 11:30:45,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {33543#true} assume !(0 == ~__BLAST_NONDET~5); {33543#true} is VALID [2022-04-15 11:30:45,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {33543#true} #res := -1073741823; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {33543#true} {33543#true} #1176#return; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {33543#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {33543#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {33543#true} {33543#true} #1220#return; {33543#true} is VALID [2022-04-15 11:30:45,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {33543#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L272 TraceCheckUtils]: 36: Hoare triple {33543#true} call stub_driver_init(); {33602#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:45,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {33602#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33543#true} {33543#true} #1222#return; {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {33543#true} assume !!(~status~5 >= 0); {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {33543#true} assume !(0 == ~__BLAST_NONDET~0); {33543#true} is VALID [2022-04-15 11:30:45,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {33543#true} assume !(1 == ~__BLAST_NONDET~0); {33543#true} is VALID [2022-04-15 11:30:45,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {33543#true} assume !(2 == ~__BLAST_NONDET~0); {33543#true} is VALID [2022-04-15 11:30:45,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {33543#true} assume !(3 == ~__BLAST_NONDET~0); {33543#true} is VALID [2022-04-15 11:30:45,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {33543#true} assume !(4 == ~__BLAST_NONDET~0); {33543#true} is VALID [2022-04-15 11:30:45,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {33543#true} assume 8 == ~__BLAST_NONDET~0; {33543#true} is VALID [2022-04-15 11:30:45,938 INFO L272 TraceCheckUtils]: 47: Hoare triple {33543#true} call #t~ret176 := KbFilter_InternIoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {33603#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:45,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {33603#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {33543#true} is VALID [2022-04-15 11:30:45,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {33543#true} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {33543#true} is VALID [2022-04-15 11:30:45,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {33543#true} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {33543#true} is VALID [2022-04-15 11:30:45,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {33543#true} assume 0 != (#t~mem62.base + #t~mem62.offset) % 4294967296;havoc #t~mem62.base, #t~mem62.offset;~status~2 := -1073741757; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,952 INFO L272 TraceCheckUtils]: 53: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {33610#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:30:45,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {33610#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {33543#true} is VALID [2022-04-15 11:30:45,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {33543#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {33543#true} is VALID [2022-04-15 11:30:45,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 11:30:45,953 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {33543#true} {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} #1248#return; {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} is VALID [2022-04-15 11:30:45,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {33604#(<= (+ 1073741757 KbFilter_InternIoCtl_~status~2) 0)} #res := ~status~2; {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} is VALID [2022-04-15 11:30:45,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} assume true; {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} is VALID [2022-04-15 11:30:45,955 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {33609#(<= (+ 1073741757 |KbFilter_InternIoCtl_#res|) 0)} {33543#true} #1234#return; {33587#(not (= 259 |main_#t~ret176|))} is VALID [2022-04-15 11:30:45,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {33587#(not (= 259 |main_#t~ret176|))} assume -2147483648 <= #t~ret176 && #t~ret176 <= 2147483647;~status~5 := #t~ret176;havoc #t~ret176; {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {33588#(not (= main_~status~5 259))} assume 0 != ~we_should_unload~0; {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {33588#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {33588#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {33588#(not (= main_~status~5 259))} assume !(~s~0 == ~UNLOADED~0); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {33588#(not (= main_~status~5 259))} assume !(-1 == ~status~5); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {33588#(not (= main_~status~5 259))} assume ~s~0 != ~SKIP2~0; {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {33588#(not (= main_~status~5 259))} assume ~s~0 != ~IPC~0; {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {33588#(not (= main_~status~5 259))} assume !(~s~0 != ~DC~0); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {33588#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {33588#(not (= main_~status~5 259))} assume ~s~0 == ~DC~0; {33588#(not (= main_~status~5 259))} is VALID [2022-04-15 11:30:45,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {33588#(not (= main_~status~5 259))} assume 259 == ~status~5; {33544#false} is VALID [2022-04-15 11:30:45,959 INFO L272 TraceCheckUtils]: 73: Hoare triple {33544#false} call errorFn(); {33544#false} is VALID [2022-04-15 11:30:45,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-15 11:30:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934588973] [2022-04-15 11:30:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934588973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:45,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:45,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:30:45,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:45,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1381251207] [2022-04-15 11:30:45,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1381251207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:45,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:45,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:30:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442648615] [2022-04-15 11:30:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-04-15 11:30:45,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:45,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:46,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:46,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:30:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:30:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:30:46,032 INFO L87 Difference]: Start difference. First operand 345 states and 447 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:48,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:58,067 INFO L93 Difference]: Finished difference Result 417 states and 534 transitions. [2022-04-15 11:30:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:30:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-04-15 11:30:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 480 transitions. [2022-04-15 11:30:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 480 transitions. [2022-04-15 11:30:58,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 480 transitions. [2022-04-15 11:30:58,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:58,625 INFO L225 Difference]: With dead ends: 417 [2022-04-15 11:30:58,625 INFO L226 Difference]: Without dead ends: 359 [2022-04-15 11:30:58,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:30:58,626 INFO L913 BasicCegarLoop]: 278 mSDtfsCounter, 601 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 231 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:58,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 741 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1848 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:30:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-15 11:30:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 344. [2022-04-15 11:30:59,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:59,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:59,102 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:59,102 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:59,110 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2022-04-15 11:30:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 463 transitions. [2022-04-15 11:30:59,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:59,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:59,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) Second operand 359 states. [2022-04-15 11:30:59,112 INFO L87 Difference]: Start difference. First operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) Second operand 359 states. [2022-04-15 11:30:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:59,120 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2022-04-15 11:30:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 463 transitions. [2022-04-15 11:30:59,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:59,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:59,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:59,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.336996336996337) internal successors, (365), 277 states have internal predecessors, (365), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-04-15 11:30:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2022-04-15 11:30:59,132 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 75 [2022-04-15 11:30:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:59,132 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2022-04-15 11:30:59,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:30:59,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 442 transitions. [2022-04-15 11:30:59,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2022-04-15 11:30:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:30:59,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:59,872 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:59,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:30:59,873 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash 476602328, now seen corresponding path program 1 times [2022-04-15 11:30:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:59,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444318364] [2022-04-15 11:30:59,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 476602328, now seen corresponding path program 2 times [2022-04-15 11:30:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:59,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115370029] [2022-04-15 11:30:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {35916#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35867#true} {35867#true} #1270#return; {35867#true} is VALID [2022-04-15 11:31:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {35917#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume true; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35875#(not (= ~SKIP1~0 ~NP~0))} {35867#true} #1216#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:31:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {35867#true} ~cond := #in~cond; {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {35867#true} assume !(0 == ~cond); {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35867#true} {35867#true} #1254#return; {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {35918#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L272 TraceCheckUtils]: 1: Hoare triple {35867#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {35867#true} is VALID [2022-04-15 11:31:00,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {35867#true} ~cond := #in~cond; {35867#true} is VALID [2022-04-15 11:31:00,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {35867#true} assume !(0 == ~cond); {35867#true} is VALID [2022-04-15 11:31:00,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,123 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {35867#true} {35867#true} #1254#return; {35867#true} is VALID [2022-04-15 11:31:00,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {35867#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {35867#true} is VALID [2022-04-15 11:31:00,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,124 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1218#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:31:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {35867#true} is VALID [2022-04-15 11:31:00,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {35867#true} assume !(0 == ~__BLAST_NONDET~5); {35867#true} is VALID [2022-04-15 11:31:00,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {35867#true} #res := -1073741823; {35867#true} is VALID [2022-04-15 11:31:00,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,157 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {35867#true} {35867#true} #1176#return; {35867#true} is VALID [2022-04-15 11:31:00,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L272 TraceCheckUtils]: 1: Hoare triple {35867#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {35867#true} assume !(0 == ~__BLAST_NONDET~5); {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {35867#true} #res := -1073741823; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35867#true} {35867#true} #1176#return; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {35867#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {35867#true} is VALID [2022-04-15 11:31:00,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {35867#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {35867#true} is VALID [2022-04-15 11:31:00,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1220#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:31:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {35929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1222#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 11:31:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:31:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:00,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {35941#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET~16; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} assume true; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {35943#(= ~NP~0 |old(~s~0)|)} {35931#(= ~SKIP1~0 ~s~0)} #1268#return; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {35930#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {35867#true} is VALID [2022-04-15 11:31:00,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {35867#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {35867#true} is VALID [2022-04-15 11:31:00,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {35867#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {35867#true} is VALID [2022-04-15 11:31:00,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {35867#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35931#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:31:00,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {35931#(= ~SKIP1~0 ~s~0)} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {35931#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:31:00,290 INFO L272 TraceCheckUtils]: 5: Hoare triple {35931#(= ~SKIP1~0 ~s~0)} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {35941#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:00,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {35941#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET~16; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} assume true; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,294 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {35943#(= ~NP~0 |old(~s~0)|)} {35931#(= ~SKIP1~0 ~s~0)} #1268#return; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {35940#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {35940#(= ~SKIP1~0 ~NP~0)} assume true; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35940#(= ~SKIP1~0 ~NP~0)} {35875#(not (= ~SKIP1~0 ~NP~0))} #1232#return; {35868#false} is VALID [2022-04-15 11:31:00,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {35867#true} call ULTIMATE.init(); {35916#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:00,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {35916#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35867#true} {35867#true} #1270#return; {35867#true} is VALID [2022-04-15 11:31:00,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {35867#true} call #t~ret213 := main(); {35867#true} is VALID [2022-04-15 11:31:00,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {35867#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {35867#true} is VALID [2022-04-15 11:31:00,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {35867#true} call _BLAST_init(); {35917#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:00,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {35917#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume true; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,300 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {35875#(not (= ~SKIP1~0 ~NP~0))} {35867#true} #1216#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,301 INFO L272 TraceCheckUtils]: 10: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {35918#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:00,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {35918#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {35867#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {35867#true} ~cond := #in~cond; {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {35867#true} assume !(0 == ~cond); {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35867#true} {35867#true} #1254#return; {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {35867#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {35867#true} is VALID [2022-04-15 11:31:00,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,303 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1218#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,305 INFO L272 TraceCheckUtils]: 23: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:00,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,306 INFO L272 TraceCheckUtils]: 25: Hoare triple {35867#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:00,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {35923#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {35867#true} assume !(0 == ~__BLAST_NONDET~5); {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {35867#true} #res := -1073741823; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35867#true} {35867#true} #1176#return; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {35867#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {35867#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {35867#true} is VALID [2022-04-15 11:31:00,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,308 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1220#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,309 INFO L272 TraceCheckUtils]: 36: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {35929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:00,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {35929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35867#true} is VALID [2022-04-15 11:31:00,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {35867#true} assume true; {35867#true} is VALID [2022-04-15 11:31:00,310 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {35867#true} {35875#(not (= ~SKIP1~0 ~NP~0))} #1222#return; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~5 >= 0); {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume !(0 == ~__BLAST_NONDET~0); {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume !(1 == ~__BLAST_NONDET~0); {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET~0); {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET~0); {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET~0; {35875#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:31:00,313 INFO L272 TraceCheckUtils]: 46: Hoare triple {35875#(not (= ~SKIP1~0 ~NP~0))} call #t~ret175 := KbFilter_Power(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35930#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:00,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {35930#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {35867#true} is VALID [2022-04-15 11:31:00,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {35867#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {35867#true} is VALID [2022-04-15 11:31:00,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {35867#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {35867#true} is VALID [2022-04-15 11:31:00,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {35867#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35931#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:31:00,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {35931#(= ~SKIP1~0 ~s~0)} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {35931#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:31:00,315 INFO L272 TraceCheckUtils]: 52: Hoare triple {35931#(= ~SKIP1~0 ~s~0)} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {35941#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:00,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {35941#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET~16; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {35942#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {35942#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {35943#(= ~NP~0 |old(~s~0)|)} assume true; {35943#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:00,318 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35943#(= ~NP~0 |old(~s~0)|)} {35931#(= ~SKIP1~0 ~s~0)} #1268#return; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {35940#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {35940#(= ~SKIP1~0 ~NP~0)} assume true; {35940#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:31:00,319 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35940#(= ~SKIP1~0 ~NP~0)} {35875#(not (= ~SKIP1~0 ~NP~0))} #1232#return; {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {35868#false} assume -2147483648 <= #t~ret175 && #t~ret175 <= 2147483647;~status~5 := #t~ret175;havoc #t~ret175; {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {35868#false} assume 0 != ~we_should_unload~0; {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {35868#false} assume !(1 == ~pended~0); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {35868#false} assume !(1 == ~pended~0); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {35868#false} assume !(~s~0 == ~UNLOADED~0); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {35868#false} assume !(-1 == ~status~5); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {35868#false} assume !(~s~0 != ~SKIP2~0); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {35868#false} assume !(1 == ~pended~0); {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {35868#false} assume ~s~0 == ~DC~0; {35868#false} is VALID [2022-04-15 11:31:00,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {35868#false} assume 259 == ~status~5; {35868#false} is VALID [2022-04-15 11:31:00,321 INFO L272 TraceCheckUtils]: 74: Hoare triple {35868#false} call errorFn(); {35868#false} is VALID [2022-04-15 11:31:00,321 INFO L290 TraceCheckUtils]: 75: Hoare triple {35868#false} assume !false; {35868#false} is VALID [2022-04-15 11:31:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:00,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115370029] [2022-04-15 11:31:00,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115370029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:00,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:00,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:31:00,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:00,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444318364] [2022-04-15 11:31:00,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444318364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:00,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:00,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:31:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339166475] [2022-04-15 11:31:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-04-15 11:31:00,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:00,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:31:00,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:00,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:31:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:31:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:31:00,398 INFO L87 Difference]: Start difference. First operand 344 states and 442 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:31:02,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:06,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:13,139 INFO L93 Difference]: Finished difference Result 422 states and 536 transitions. [2022-04-15 11:31:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 11:31:13,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-04-15 11:31:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:31:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 508 transitions. [2022-04-15 11:31:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:31:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 508 transitions. [2022-04-15 11:31:13,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 508 transitions. [2022-04-15 11:31:13,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:13,758 INFO L225 Difference]: With dead ends: 422 [2022-04-15 11:31:13,758 INFO L226 Difference]: Without dead ends: 379 [2022-04-15 11:31:13,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 11:31:13,759 INFO L913 BasicCegarLoop]: 302 mSDtfsCounter, 1221 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 437 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:13,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 720 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1550 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:31:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-15 11:31:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-04-15 11:31:14,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:14,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) [2022-04-15 11:31:14,233 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) [2022-04-15 11:31:14,234 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) [2022-04-15 11:31:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:14,240 INFO L93 Difference]: Finished difference Result 379 states and 484 transitions. [2022-04-15 11:31:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 484 transitions. [2022-04-15 11:31:14,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:14,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:14,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) Second operand 379 states. [2022-04-15 11:31:14,241 INFO L87 Difference]: Start difference. First operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) Second operand 379 states. [2022-04-15 11:31:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:14,250 INFO L93 Difference]: Finished difference Result 379 states and 484 transitions. [2022-04-15 11:31:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 484 transitions. [2022-04-15 11:31:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:14,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:14,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.3296703296703296) internal successors, (363), 277 states have internal predecessors, (363), 38 states have call successors, (38), 30 states have call predecessors, (38), 32 states have return successors, (38), 36 states have call predecessors, (38), 33 states have call successors, (38) [2022-04-15 11:31:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 439 transitions. [2022-04-15 11:31:14,261 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 439 transitions. Word has length 76 [2022-04-15 11:31:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:14,261 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 439 transitions. [2022-04-15 11:31:14,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:31:14,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 439 transitions. [2022-04-15 11:31:15,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 439 transitions. [2022-04-15 11:31:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:31:15,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:15,169 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:15,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:31:15,169 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1346047832, now seen corresponding path program 1 times [2022-04-15 11:31:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:15,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591303462] [2022-04-15 11:31:15,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1346047832, now seen corresponding path program 2 times [2022-04-15 11:31:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:15,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611097865] [2022-04-15 11:31:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {38327#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38282#true} {38282#true} #1270#return; {38282#true} is VALID [2022-04-15 11:31:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {38328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38282#true} {38282#true} #1216#return; {38282#true} is VALID [2022-04-15 11:31:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:31:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {38282#true} ~cond := #in~cond; {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume !(0 == ~cond); {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38282#true} {38282#true} #1254#return; {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {38329#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L272 TraceCheckUtils]: 1: Hoare triple {38282#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {38282#true} is VALID [2022-04-15 11:31:15,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {38282#true} ~cond := #in~cond; {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {38282#true} assume !(0 == ~cond); {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38282#true} {38282#true} #1254#return; {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {38282#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,400 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {38282#true} {38282#true} #1218#return; {38282#true} is VALID [2022-04-15 11:31:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:31:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {38282#true} is VALID [2022-04-15 11:31:15,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume !(0 == ~__BLAST_NONDET~5); {38282#true} is VALID [2022-04-15 11:31:15,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {38282#true} #res := -1073741823; {38282#true} is VALID [2022-04-15 11:31:15,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,429 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38282#true} {38282#true} #1176#return; {38282#true} is VALID [2022-04-15 11:31:15,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,430 INFO L272 TraceCheckUtils]: 1: Hoare triple {38282#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {38282#true} assume !(0 == ~__BLAST_NONDET~5); {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {38282#true} #res := -1073741823; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38282#true} {38282#true} #1176#return; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {38282#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38282#true} {38282#true} #1220#return; {38282#true} is VALID [2022-04-15 11:31:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:31:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {38340#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38282#true} {38282#true} #1222#return; {38282#true} is VALID [2022-04-15 11:31:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-04-15 11:31:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:15,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {38347#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {38282#true} is VALID [2022-04-15 11:31:15,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {38282#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {38282#true} is VALID [2022-04-15 11:31:15,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38282#true} {38283#false} #1248#return; {38283#false} is VALID [2022-04-15 11:31:15,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {38341#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(0 != (#t~mem62.base + #t~mem62.offset) % 4294967296);havoc #t~mem62.base, #t~mem62.offset;call #t~mem63 := read~int(~irpStack~2.base, 8 + ~irpStack~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(#t~mem63 % 4294967296 < 8);havoc #t~mem63;call #t~mem64.base, #t~mem64.offset := read~$Pointer$(~irpStack~2.base, 16 + ~irpStack~2.offset, 4);~connectData~0.base, ~connectData~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset;call #t~mem65.base, #t~mem65.offset := read~$Pointer$(~connectData~0.base, ~connectData~0.offset, 4);call #t~mem66.base, #t~mem66.offset := read~$Pointer$(~connectData~0.base, 4 + ~connectData~0.offset, 4);call write~$Pointer$(#t~mem65.base, #t~mem65.offset, ~devExt~2.base, 16 + ~devExt~2.offset, 4);call write~$Pointer$(#t~mem66.base, #t~mem66.offset, ~devExt~2.base, 20 + ~devExt~2.offset, 4);havoc #t~mem65.base, #t~mem65.offset;havoc #t~mem66.base, #t~mem66.offset;call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~devExt~2.base, ~devExt~2.offset, 4);call write~$Pointer$(#t~mem67.base, #t~mem67.offset, ~connectData~0.base, ~connectData~0.offset, 4);havoc #t~mem67.base, #t~mem67.offset;call write~$Pointer$(#funAddr~KbFilter_ServiceCallback.base, #funAddr~KbFilter_ServiceCallback.offset, ~connectData~0.base, 4 + ~connectData~0.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {38283#false} is VALID [2022-04-15 11:31:15,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {38283#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {38347#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:15,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {38347#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {38282#true} is VALID [2022-04-15 11:31:15,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {38282#true} is VALID [2022-04-15 11:31:15,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38282#true} {38283#false} #1248#return; {38283#false} is VALID [2022-04-15 11:31:15,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {38283#false} #res := ~status~2; {38283#false} is VALID [2022-04-15 11:31:15,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {38283#false} assume true; {38283#false} is VALID [2022-04-15 11:31:15,518 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {38283#false} {38282#true} #1234#return; {38283#false} is VALID [2022-04-15 11:31:15,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {38282#true} call ULTIMATE.init(); {38327#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:15,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {38327#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38282#true} {38282#true} #1270#return; {38282#true} is VALID [2022-04-15 11:31:15,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {38282#true} call #t~ret213 := main(); {38282#true} is VALID [2022-04-15 11:31:15,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {38282#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {38282#true} is VALID [2022-04-15 11:31:15,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {38282#true} call _BLAST_init(); {38328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:15,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {38328#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,521 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {38282#true} {38282#true} #1216#return; {38282#true} is VALID [2022-04-15 11:31:15,522 INFO L272 TraceCheckUtils]: 10: Hoare triple {38282#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {38329#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:15,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {38329#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L272 TraceCheckUtils]: 12: Hoare triple {38282#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {38282#true} ~cond := #in~cond; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {38282#true} assume !(0 == ~cond); {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38282#true} {38282#true} #1254#return; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {38282#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {38282#true} {38282#true} #1218#return; {38282#true} is VALID [2022-04-15 11:31:15,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {38282#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {38282#true} is VALID [2022-04-15 11:31:15,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {38282#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {38282#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {38282#true} is VALID [2022-04-15 11:31:15,525 INFO L272 TraceCheckUtils]: 23: Hoare triple {38282#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:15,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,526 INFO L272 TraceCheckUtils]: 25: Hoare triple {38282#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:15,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {38334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {38282#true} is VALID [2022-04-15 11:31:15,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {38282#true} assume !(0 == ~__BLAST_NONDET~5); {38282#true} is VALID [2022-04-15 11:31:15,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {38282#true} #res := -1073741823; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38282#true} {38282#true} #1176#return; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {38282#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {38282#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38282#true} {38282#true} #1220#return; {38282#true} is VALID [2022-04-15 11:31:15,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {38282#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {38282#true} is VALID [2022-04-15 11:31:15,528 INFO L272 TraceCheckUtils]: 36: Hoare triple {38282#true} call stub_driver_init(); {38340#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:15,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {38340#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {38282#true} is VALID [2022-04-15 11:31:15,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,528 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38282#true} {38282#true} #1222#return; {38282#true} is VALID [2022-04-15 11:31:15,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {38282#true} assume !!(~status~5 >= 0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {38282#true} assume !(0 == ~__BLAST_NONDET~0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {38282#true} assume !(1 == ~__BLAST_NONDET~0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {38282#true} assume !(2 == ~__BLAST_NONDET~0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {38282#true} assume !(3 == ~__BLAST_NONDET~0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {38282#true} assume !(4 == ~__BLAST_NONDET~0); {38282#true} is VALID [2022-04-15 11:31:15,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {38282#true} assume 8 == ~__BLAST_NONDET~0; {38282#true} is VALID [2022-04-15 11:31:15,530 INFO L272 TraceCheckUtils]: 47: Hoare triple {38282#true} call #t~ret176 := KbFilter_InternIoCtl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {38341#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:15,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {38341#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~2.base, ~irpStack~2.offset;havoc ~devExt~2.base, ~devExt~2.offset;havoc ~hookKeyboard~0.base, ~hookKeyboard~0.offset;havoc ~connectData~0.base, ~connectData~0.offset;havoc ~status~2;havoc ~tmp~2;~status~2 := 0;call #t~mem51.base, #t~mem51.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~2.base, ~devExt~2.offset := #t~mem51.base, #t~mem51.offset;havoc #t~mem51.base, #t~mem51.offset;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4);call #t~mem52.base, #t~mem52.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~2.base, ~irpStack~2.offset := #t~mem52.base, #t~mem52.offset;havoc #t~mem52.base, #t~mem52.offset;call #t~mem53 := read~int(~irpStack~2.base, 12 + ~irpStack~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume #t~mem53 % 4294967296 == ~bitwiseOr(~bitwiseOr(720896, 512), 3) % 4294967296;havoc #t~mem53; {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} call #t~mem62.base, #t~mem62.offset := read~$Pointer$(~devExt~2.base, 20 + ~devExt~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(0 != (#t~mem62.base + #t~mem62.offset) % 4294967296);havoc #t~mem62.base, #t~mem62.offset;call #t~mem63 := read~int(~irpStack~2.base, 8 + ~irpStack~2.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(#t~mem63 % 4294967296 < 8);havoc #t~mem63;call #t~mem64.base, #t~mem64.offset := read~$Pointer$(~irpStack~2.base, 16 + ~irpStack~2.offset, 4);~connectData~0.base, ~connectData~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset;call #t~mem65.base, #t~mem65.offset := read~$Pointer$(~connectData~0.base, ~connectData~0.offset, 4);call #t~mem66.base, #t~mem66.offset := read~$Pointer$(~connectData~0.base, 4 + ~connectData~0.offset, 4);call write~$Pointer$(#t~mem65.base, #t~mem65.offset, ~devExt~2.base, 16 + ~devExt~2.offset, 4);call write~$Pointer$(#t~mem66.base, #t~mem66.offset, ~devExt~2.base, 20 + ~devExt~2.offset, 4);havoc #t~mem65.base, #t~mem65.offset;havoc #t~mem66.base, #t~mem66.offset;call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~devExt~2.base, ~devExt~2.offset, 4);call write~$Pointer$(#t~mem67.base, #t~mem67.offset, ~connectData~0.base, ~connectData~0.offset, 4);havoc #t~mem67.base, #t~mem67.offset;call write~$Pointer$(#funAddr~KbFilter_ServiceCallback.base, #funAddr~KbFilter_ServiceCallback.offset, ~connectData~0.base, 4 + ~connectData~0.offset, 4); {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {38342#(<= 0 KbFilter_InternIoCtl_~status~2)} assume !(~status~2 >= 0);call write~int(~status~2, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~2; {38283#false} is VALID [2022-04-15 11:31:15,533 INFO L272 TraceCheckUtils]: 54: Hoare triple {38283#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {38347#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {38347#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {38282#true} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {38282#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {38282#true} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {38282#true} assume true; {38282#true} is VALID [2022-04-15 11:31:15,533 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38282#true} {38283#false} #1248#return; {38283#false} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {38283#false} #res := ~status~2; {38283#false} is VALID [2022-04-15 11:31:15,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {38283#false} assume true; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {38283#false} {38282#true} #1234#return; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {38283#false} assume -2147483648 <= #t~ret176 && #t~ret176 <= 2147483647;~status~5 := #t~ret176;havoc #t~ret176; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {38283#false} assume 0 != ~we_should_unload~0; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {38283#false} assume !(1 == ~pended~0); {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {38283#false} assume !(1 == ~pended~0); {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {38283#false} assume !(~s~0 == ~UNLOADED~0); {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {38283#false} assume !(-1 == ~status~5); {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {38283#false} assume ~s~0 != ~SKIP2~0; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {38283#false} assume ~s~0 != ~IPC~0; {38283#false} is VALID [2022-04-15 11:31:15,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {38283#false} assume !(~s~0 != ~DC~0); {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {38283#false} assume !(1 == ~pended~0); {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {38283#false} assume ~s~0 == ~DC~0; {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {38283#false} assume 259 == ~status~5; {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L272 TraceCheckUtils]: 74: Hoare triple {38283#false} call errorFn(); {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L290 TraceCheckUtils]: 75: Hoare triple {38283#false} assume !false; {38283#false} is VALID [2022-04-15 11:31:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611097865] [2022-04-15 11:31:15,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611097865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:15,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:15,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:31:15,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591303462] [2022-04-15 11:31:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591303462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:31:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451360224] [2022-04-15 11:31:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2022-04-15 11:31:15,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:15,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:31:15,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:15,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:31:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:15,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:31:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:31:15,616 INFO L87 Difference]: Start difference. First operand 344 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:31:17,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:21,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:25,746 INFO L93 Difference]: Finished difference Result 378 states and 480 transitions. [2022-04-15 11:31:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:31:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2022-04-15 11:31:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:31:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 427 transitions. [2022-04-15 11:31:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:31:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 427 transitions. [2022-04-15 11:31:25,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 427 transitions. [2022-04-15 11:31:26,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:26,247 INFO L225 Difference]: With dead ends: 378 [2022-04-15 11:31:26,247 INFO L226 Difference]: Without dead ends: 355 [2022-04-15 11:31:26,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:31:26,248 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 640 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 216 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:26,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 626 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1085 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 11:31:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-15 11:31:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2022-04-15 11:31:26,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:26,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:26,714 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:26,714 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:26,719 INFO L93 Difference]: Finished difference Result 355 states and 456 transitions. [2022-04-15 11:31:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 456 transitions. [2022-04-15 11:31:26,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:26,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:26,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) Second operand 355 states. [2022-04-15 11:31:26,721 INFO L87 Difference]: Start difference. First operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) Second operand 355 states. [2022-04-15 11:31:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:26,727 INFO L93 Difference]: Finished difference Result 355 states and 456 transitions. [2022-04-15 11:31:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 456 transitions. [2022-04-15 11:31:26,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:26,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:26,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:26,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 271 states have internal predecessors, (356), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 429 transitions. [2022-04-15 11:31:26,737 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 429 transitions. Word has length 76 [2022-04-15 11:31:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:26,738 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 429 transitions. [2022-04-15 11:31:26,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:31:26,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 429 transitions. [2022-04-15 11:31:27,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 429 transitions. [2022-04-15 11:31:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:31:27,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:27,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:27,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:31:27,625 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2131421, now seen corresponding path program 1 times [2022-04-15 11:31:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:27,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138135693] [2022-04-15 11:31:27,625 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2131421, now seen corresponding path program 2 times [2022-04-15 11:31:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535613694] [2022-04-15 11:31:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {40548#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {40496#true} is VALID [2022-04-15 11:31:27,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40496#true} {40496#true} #1270#return; {40496#true} is VALID [2022-04-15 11:31:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {40549#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {40496#true} is VALID [2022-04-15 11:31:27,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40496#true} {40496#true} #1216#return; {40496#true} is VALID [2022-04-15 11:31:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:31:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {40496#true} ~cond := #in~cond; {40496#true} is VALID [2022-04-15 11:31:27,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume !(0 == ~cond); {40496#true} is VALID [2022-04-15 11:31:27,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40496#true} {40496#true} #1254#return; {40496#true} is VALID [2022-04-15 11:31:27,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {40550#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {40496#true} is VALID [2022-04-15 11:31:27,871 INFO L272 TraceCheckUtils]: 1: Hoare triple {40496#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {40496#true} is VALID [2022-04-15 11:31:27,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} ~cond := #in~cond; {40496#true} is VALID [2022-04-15 11:31:27,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {40496#true} assume !(0 == ~cond); {40496#true} is VALID [2022-04-15 11:31:27,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,872 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40496#true} {40496#true} #1254#return; {40496#true} is VALID [2022-04-15 11:31:27,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {40496#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {40496#true} is VALID [2022-04-15 11:31:27,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,872 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {40496#true} {40496#true} #1218#return; {40496#true} is VALID [2022-04-15 11:31:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:31:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {40496#true} is VALID [2022-04-15 11:31:27,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume !(0 == ~__BLAST_NONDET~5); {40496#true} is VALID [2022-04-15 11:31:27,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} #res := -1073741823; {40496#true} is VALID [2022-04-15 11:31:27,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,907 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40496#true} {40496#true} #1176#return; {40496#true} is VALID [2022-04-15 11:31:27,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {40496#true} is VALID [2022-04-15 11:31:27,908 INFO L272 TraceCheckUtils]: 1: Hoare triple {40496#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:27,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {40496#true} assume !(0 == ~__BLAST_NONDET~5); {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {40496#true} #res := -1073741823; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {40496#true} {40496#true} #1176#return; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {40496#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {40496#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40496#true} {40496#true} #1220#return; {40496#true} is VALID [2022-04-15 11:31:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:31:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:27,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {40561#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {40496#true} is VALID [2022-04-15 11:31:27,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:27,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40496#true} {40496#true} #1222#return; {40496#true} is VALID [2022-04-15 11:31:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 11:31:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:31:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:28,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {40575#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {40496#true} is VALID [2022-04-15 11:31:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume !(0 != ~compRegistered~0); {40496#true} is VALID [2022-04-15 11:31:28,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} assume 0 == ~__BLAST_NONDET~16; {40496#true} is VALID [2022-04-15 11:31:28,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {40496#true} ~returnVal~0 := 0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~NP~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~MPR1~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} #res := ~returnVal~0; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} assume true; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,066 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} {40496#true} #1268#return; {40573#(= |KbFilter_Power_#t~ret136| 0)} is VALID [2022-04-15 11:31:28,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {40562#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {40496#true} is VALID [2022-04-15 11:31:28,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {40496#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {40496#true} is VALID [2022-04-15 11:31:28,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {40496#true} is VALID [2022-04-15 11:31:28,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {40496#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {40496#true} is VALID [2022-04-15 11:31:28,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {40496#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {40496#true} is VALID [2022-04-15 11:31:28,068 INFO L272 TraceCheckUtils]: 5: Hoare triple {40496#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {40575#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:28,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {40575#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {40496#true} is VALID [2022-04-15 11:31:28,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {40496#true} assume !(0 != ~compRegistered~0); {40496#true} is VALID [2022-04-15 11:31:28,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {40496#true} assume 0 == ~__BLAST_NONDET~16; {40496#true} is VALID [2022-04-15 11:31:28,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {40496#true} ~returnVal~0 := 0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~NP~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~MPR1~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} #res := ~returnVal~0; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} assume true; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} {40496#true} #1268#return; {40573#(= |KbFilter_Power_#t~ret136| 0)} is VALID [2022-04-15 11:31:28,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {40573#(= |KbFilter_Power_#t~ret136| 0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {40574#(= |KbFilter_Power_#res| 0)} is VALID [2022-04-15 11:31:28,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {40574#(= |KbFilter_Power_#res| 0)} assume true; {40574#(= |KbFilter_Power_#res| 0)} is VALID [2022-04-15 11:31:28,073 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {40574#(= |KbFilter_Power_#res| 0)} {40496#true} #1232#return; {40546#(= 0 |main_#t~ret175|)} is VALID [2022-04-15 11:31:28,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {40496#true} call ULTIMATE.init(); {40548#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:28,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {40548#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {40496#true} is VALID [2022-04-15 11:31:28,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40496#true} {40496#true} #1270#return; {40496#true} is VALID [2022-04-15 11:31:28,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {40496#true} call #t~ret213 := main(); {40496#true} is VALID [2022-04-15 11:31:28,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {40496#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {40496#true} is VALID [2022-04-15 11:31:28,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {40496#true} call _BLAST_init(); {40549#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:28,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {40549#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {40496#true} is VALID [2022-04-15 11:31:28,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,076 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {40496#true} {40496#true} #1216#return; {40496#true} is VALID [2022-04-15 11:31:28,077 INFO L272 TraceCheckUtils]: 10: Hoare triple {40496#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {40550#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {40550#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L272 TraceCheckUtils]: 12: Hoare triple {40496#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {40496#true} ~cond := #in~cond; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {40496#true} assume !(0 == ~cond); {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40496#true} {40496#true} #1254#return; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {40496#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {40496#true} {40496#true} #1218#return; {40496#true} is VALID [2022-04-15 11:31:28,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {40496#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {40496#true} is VALID [2022-04-15 11:31:28,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {40496#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {40496#true} is VALID [2022-04-15 11:31:28,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {40496#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {40496#true} is VALID [2022-04-15 11:31:28,080 INFO L272 TraceCheckUtils]: 23: Hoare triple {40496#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:28,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {40496#true} is VALID [2022-04-15 11:31:28,081 INFO L272 TraceCheckUtils]: 25: Hoare triple {40496#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:28,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {40555#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {40496#true} is VALID [2022-04-15 11:31:28,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {40496#true} assume !(0 == ~__BLAST_NONDET~5); {40496#true} is VALID [2022-04-15 11:31:28,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {40496#true} #res := -1073741823; {40496#true} is VALID [2022-04-15 11:31:28,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {40496#true} {40496#true} #1176#return; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {40496#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {40496#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {40496#true} {40496#true} #1220#return; {40496#true} is VALID [2022-04-15 11:31:28,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {40496#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L272 TraceCheckUtils]: 36: Hoare triple {40496#true} call stub_driver_init(); {40561#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {40561#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {40496#true} assume true; {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40496#true} {40496#true} #1222#return; {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {40496#true} assume !!(~status~5 >= 0); {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {40496#true} assume !(0 == ~__BLAST_NONDET~0); {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {40496#true} assume !(1 == ~__BLAST_NONDET~0); {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {40496#true} assume !(2 == ~__BLAST_NONDET~0); {40496#true} is VALID [2022-04-15 11:31:28,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {40496#true} assume !(3 == ~__BLAST_NONDET~0); {40496#true} is VALID [2022-04-15 11:31:28,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {40496#true} assume 4 == ~__BLAST_NONDET~0; {40496#true} is VALID [2022-04-15 11:31:28,085 INFO L272 TraceCheckUtils]: 46: Hoare triple {40496#true} call #t~ret175 := KbFilter_Power(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {40562#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:28,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {40562#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {40496#true} is VALID [2022-04-15 11:31:28,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {40496#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {40496#true} is VALID [2022-04-15 11:31:28,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {40496#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {40496#true} is VALID [2022-04-15 11:31:28,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {40496#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {40496#true} is VALID [2022-04-15 11:31:28,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {40496#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {40496#true} is VALID [2022-04-15 11:31:28,086 INFO L272 TraceCheckUtils]: 52: Hoare triple {40496#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {40575#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:28,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {40575#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {40496#true} is VALID [2022-04-15 11:31:28,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {40496#true} assume !(0 != ~compRegistered~0); {40496#true} is VALID [2022-04-15 11:31:28,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {40496#true} assume 0 == ~__BLAST_NONDET~16; {40496#true} is VALID [2022-04-15 11:31:28,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {40496#true} ~returnVal~0 := 0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~NP~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume !(~s~0 == ~MPR1~0); {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} is VALID [2022-04-15 11:31:28,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {40576#(and (<= 0 PoCallDriver_~returnVal~0) (<= PoCallDriver_~returnVal~0 0))} #res := ~returnVal~0; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} assume true; {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} is VALID [2022-04-15 11:31:28,090 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {40577#(and (<= |PoCallDriver_#res| 0) (<= 0 |PoCallDriver_#res|))} {40496#true} #1268#return; {40573#(= |KbFilter_Power_#t~ret136| 0)} is VALID [2022-04-15 11:31:28,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {40573#(= |KbFilter_Power_#t~ret136| 0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {40574#(= |KbFilter_Power_#res| 0)} is VALID [2022-04-15 11:31:28,091 INFO L290 TraceCheckUtils]: 64: Hoare triple {40574#(= |KbFilter_Power_#res| 0)} assume true; {40574#(= |KbFilter_Power_#res| 0)} is VALID [2022-04-15 11:31:28,091 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {40574#(= |KbFilter_Power_#res| 0)} {40496#true} #1232#return; {40546#(= 0 |main_#t~ret175|)} is VALID [2022-04-15 11:31:28,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {40546#(= 0 |main_#t~ret175|)} assume -2147483648 <= #t~ret175 && #t~ret175 <= 2147483647;~status~5 := #t~ret175;havoc #t~ret175; {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,092 INFO L290 TraceCheckUtils]: 67: Hoare triple {40547#(= main_~status~5 0)} assume 0 != ~we_should_unload~0; {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {40547#(= main_~status~5 0)} assume !(1 == ~pended~0); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {40547#(= main_~status~5 0)} assume !(1 == ~pended~0); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {40547#(= main_~status~5 0)} assume !(~s~0 == ~UNLOADED~0); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {40547#(= main_~status~5 0)} assume !(-1 == ~status~5); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {40547#(= main_~status~5 0)} assume !(~s~0 != ~SKIP2~0); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {40547#(= main_~status~5 0)} assume !(1 == ~pended~0); {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {40547#(= main_~status~5 0)} assume ~s~0 == ~DC~0; {40547#(= main_~status~5 0)} is VALID [2022-04-15 11:31:28,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {40547#(= main_~status~5 0)} assume 259 == ~status~5; {40497#false} is VALID [2022-04-15 11:31:28,095 INFO L272 TraceCheckUtils]: 76: Hoare triple {40497#false} call errorFn(); {40497#false} is VALID [2022-04-15 11:31:28,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {40497#false} assume !false; {40497#false} is VALID [2022-04-15 11:31:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:28,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535613694] [2022-04-15 11:31:28,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535613694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:28,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:28,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:31:28,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:28,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138135693] [2022-04-15 11:31:28,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138135693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:28,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:28,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:31:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377289592] [2022-04-15 11:31:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2022-04-15 11:31:28,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:28,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:28,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:28,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:31:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:31:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:31:28,184 INFO L87 Difference]: Start difference. First operand 335 states and 429 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:30,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:48,791 INFO L93 Difference]: Finished difference Result 398 states and 505 transitions. [2022-04-15 11:31:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:31:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2022-04-15 11:31:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 444 transitions. [2022-04-15 11:31:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 444 transitions. [2022-04-15 11:31:48,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 444 transitions. [2022-04-15 11:31:49,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:49,419 INFO L225 Difference]: With dead ends: 398 [2022-04-15 11:31:49,420 INFO L226 Difference]: Without dead ends: 354 [2022-04-15 11:31:49,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:31:49,421 INFO L913 BasicCegarLoop]: 270 mSDtfsCounter, 471 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:49,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 956 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2402 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2022-04-15 11:31:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-15 11:31:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2022-04-15 11:31:49,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:49,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:49,907 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:49,907 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:49,918 INFO L93 Difference]: Finished difference Result 354 states and 454 transitions. [2022-04-15 11:31:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 454 transitions. [2022-04-15 11:31:49,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:49,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:49,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) Second operand 354 states. [2022-04-15 11:31:49,921 INFO L87 Difference]: Start difference. First operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) Second operand 354 states. [2022-04-15 11:31:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:49,928 INFO L93 Difference]: Finished difference Result 354 states and 454 transitions. [2022-04-15 11:31:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 454 transitions. [2022-04-15 11:31:49,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:49,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:49,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:49,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 266 states have (on average 1.330827067669173) internal successors, (354), 270 states have internal predecessors, (354), 37 states have call successors, (37), 29 states have call predecessors, (37), 30 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-04-15 11:31:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 427 transitions. [2022-04-15 11:31:49,939 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 427 transitions. Word has length 78 [2022-04-15 11:31:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:49,939 INFO L478 AbstractCegarLoop]: Abstraction has 334 states and 427 transitions. [2022-04-15 11:31:49,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:49,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 334 states and 427 transitions. [2022-04-15 11:31:50,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 427 transitions. [2022-04-15 11:31:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 11:31:50,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:50,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:50,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:31:50,692 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1889602735, now seen corresponding path program 1 times [2022-04-15 11:31:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417959107] [2022-04-15 11:31:50,694 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1889602735, now seen corresponding path program 2 times [2022-04-15 11:31:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847705541] [2022-04-15 11:31:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {42818#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {42764#true} is VALID [2022-04-15 11:31:50,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42764#true} {42764#true} #1270#return; {42764#true} is VALID [2022-04-15 11:31:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {42819#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {42764#true} is VALID [2022-04-15 11:31:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42764#true} {42764#true} #1216#return; {42764#true} is VALID [2022-04-15 11:31:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:31:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {42764#true} ~cond := #in~cond; {42764#true} is VALID [2022-04-15 11:31:50,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume !(0 == ~cond); {42764#true} is VALID [2022-04-15 11:31:50,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42764#true} {42764#true} #1254#return; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {42820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L272 TraceCheckUtils]: 1: Hoare triple {42764#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} ~cond := #in~cond; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {42764#true} assume !(0 == ~cond); {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42764#true} {42764#true} #1254#return; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {42764#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,949 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {42764#true} {42764#true} #1218#return; {42764#true} is VALID [2022-04-15 11:31:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:31:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:31:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:50,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {42764#true} is VALID [2022-04-15 11:31:50,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume !(0 == ~__BLAST_NONDET~5); {42764#true} is VALID [2022-04-15 11:31:50,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} #res := -1073741823; {42764#true} is VALID [2022-04-15 11:31:50,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,983 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42764#true} {42764#true} #1176#return; {42764#true} is VALID [2022-04-15 11:31:50,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L272 TraceCheckUtils]: 1: Hoare triple {42764#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {42764#true} assume !(0 == ~__BLAST_NONDET~5); {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {42764#true} #res := -1073741823; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42764#true} {42764#true} #1176#return; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {42764#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {42764#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:50,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42764#true} {42764#true} #1220#return; {42764#true} is VALID [2022-04-15 11:31:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:31:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:51,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {42831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42764#true} {42764#true} #1222#return; {42764#true} is VALID [2022-04-15 11:31:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 11:31:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:51,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {42846#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {42764#true} is VALID [2022-04-15 11:31:51,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume !(0 != ~compRegistered~0); {42764#true} is VALID [2022-04-15 11:31:51,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} assume 0 == ~__BLAST_NONDET~11; {42764#true} is VALID [2022-04-15 11:31:51,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {42764#true} ~returnVal2~0 := 0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~MPR1~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,181 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {42764#true} #1200#return; {42843#(= |KbFilter_PnP_#t~ret114| 0)} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {42832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {42764#true} assume !(0 == #t~mem81 % 256);havoc #t~mem81;call #t~mem82 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} assume 23 == #t~mem82 % 256;havoc #t~mem82; {42764#true} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {42764#true} call write~int(1, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {42764#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {42764#true} is VALID [2022-04-15 11:31:51,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {42764#true} call #t~mem111 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem111) % 256 <= 127 then (1 + #t~mem111) % 256 else (1 + #t~mem111) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem111;call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem112.base, 36 + #t~mem112.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem112.base, #t~mem112.offset;call #t~mem113.base, #t~mem113.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {42764#true} is VALID [2022-04-15 11:31:51,183 INFO L272 TraceCheckUtils]: 6: Hoare triple {42764#true} call #t~ret114 := IofCallDriver(#t~mem113.base, #t~mem113.offset, ~Irp.base, ~Irp.offset); {42846#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:51,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {42846#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {42764#true} is VALID [2022-04-15 11:31:51,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {42764#true} assume !(0 != ~compRegistered~0); {42764#true} is VALID [2022-04-15 11:31:51,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {42764#true} assume 0 == ~__BLAST_NONDET~11; {42764#true} is VALID [2022-04-15 11:31:51,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {42764#true} ~returnVal2~0 := 0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~MPR1~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,188 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {42764#true} #1200#return; {42843#(= |KbFilter_PnP_#t~ret114| 0)} is VALID [2022-04-15 11:31:51,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {42843#(= |KbFilter_PnP_#t~ret114| 0)} assume -2147483648 <= #t~ret114 && #t~ret114 <= 2147483647;~status~3 := #t~ret114;havoc #t~mem113.base, #t~mem113.offset;havoc #t~ret114; {42844#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:31:51,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {42844#(= KbFilter_PnP_~status~3 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {42845#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:31:51,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {42845#(= |KbFilter_PnP_#res| 0)} assume true; {42845#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:31:51,191 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {42845#(= |KbFilter_PnP_#res| 0)} {42764#true} #1230#return; {42816#(= 0 |main_#t~ret174|)} is VALID [2022-04-15 11:31:51,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {42764#true} call ULTIMATE.init(); {42818#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:51,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {42818#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42764#true} {42764#true} #1270#return; {42764#true} is VALID [2022-04-15 11:31:51,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {42764#true} call #t~ret213 := main(); {42764#true} is VALID [2022-04-15 11:31:51,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {42764#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {42764#true} is VALID [2022-04-15 11:31:51,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {42764#true} call _BLAST_init(); {42819#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:51,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {42819#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,195 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {42764#true} {42764#true} #1216#return; {42764#true} is VALID [2022-04-15 11:31:51,196 INFO L272 TraceCheckUtils]: 10: Hoare triple {42764#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {42820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:51,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {42820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {42764#true} is VALID [2022-04-15 11:31:51,196 INFO L272 TraceCheckUtils]: 12: Hoare triple {42764#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {42764#true} ~cond := #in~cond; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {42764#true} assume !(0 == ~cond); {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42764#true} {42764#true} #1254#return; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {42764#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {42764#true} {42764#true} #1218#return; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {42764#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {42764#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {42764#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {42764#true} is VALID [2022-04-15 11:31:51,199 INFO L272 TraceCheckUtils]: 23: Hoare triple {42764#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:51,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,200 INFO L272 TraceCheckUtils]: 25: Hoare triple {42764#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:31:51,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {42825#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {42764#true} is VALID [2022-04-15 11:31:51,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {42764#true} assume !(0 == ~__BLAST_NONDET~5); {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {42764#true} #res := -1073741823; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42764#true} {42764#true} #1176#return; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {42764#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {42764#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {42764#true} {42764#true} #1220#return; {42764#true} is VALID [2022-04-15 11:31:51,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {42764#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {42764#true} is VALID [2022-04-15 11:31:51,202 INFO L272 TraceCheckUtils]: 36: Hoare triple {42764#true} call stub_driver_init(); {42831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:51,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {42831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {42764#true} is VALID [2022-04-15 11:31:51,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {42764#true} assume true; {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42764#true} {42764#true} #1222#return; {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {42764#true} assume !!(~status~5 >= 0); {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {42764#true} assume !(0 == ~__BLAST_NONDET~0); {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {42764#true} assume !(1 == ~__BLAST_NONDET~0); {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {42764#true} assume !(2 == ~__BLAST_NONDET~0); {42764#true} is VALID [2022-04-15 11:31:51,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {42764#true} assume 3 == ~__BLAST_NONDET~0; {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L272 TraceCheckUtils]: 45: Hoare triple {42764#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {42832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {42832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {42764#true} assume !(0 == #t~mem81 % 256);havoc #t~mem81;call #t~mem82 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {42764#true} assume 23 == #t~mem82 % 256;havoc #t~mem82; {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {42764#true} call write~int(1, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {42764#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {42764#true} is VALID [2022-04-15 11:31:51,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {42764#true} call #t~mem111 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem111) % 256 <= 127 then (1 + #t~mem111) % 256 else (1 + #t~mem111) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem111;call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem112.base, 36 + #t~mem112.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem112.base, #t~mem112.offset;call #t~mem113.base, #t~mem113.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {42764#true} is VALID [2022-04-15 11:31:51,206 INFO L272 TraceCheckUtils]: 52: Hoare triple {42764#true} call #t~ret114 := IofCallDriver(#t~mem113.base, #t~mem113.offset, ~Irp.base, ~Irp.offset); {42846#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:51,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {42846#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {42764#true} is VALID [2022-04-15 11:31:51,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {42764#true} assume !(0 != ~compRegistered~0); {42764#true} is VALID [2022-04-15 11:31:51,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {42764#true} assume 0 == ~__BLAST_NONDET~11; {42764#true} is VALID [2022-04-15 11:31:51,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {42764#true} ~returnVal2~0 := 0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~MPR1~0); {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:31:51,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {42847#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:31:51,210 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {42848#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {42764#true} #1200#return; {42843#(= |KbFilter_PnP_#t~ret114| 0)} is VALID [2022-04-15 11:31:51,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {42843#(= |KbFilter_PnP_#t~ret114| 0)} assume -2147483648 <= #t~ret114 && #t~ret114 <= 2147483647;~status~3 := #t~ret114;havoc #t~mem113.base, #t~mem113.offset;havoc #t~ret114; {42844#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:31:51,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {42844#(= KbFilter_PnP_~status~3 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {42845#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:31:51,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {42845#(= |KbFilter_PnP_#res| 0)} assume true; {42845#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:31:51,212 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42845#(= |KbFilter_PnP_#res| 0)} {42764#true} #1230#return; {42816#(= 0 |main_#t~ret174|)} is VALID [2022-04-15 11:31:51,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {42816#(= 0 |main_#t~ret174|)} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {42817#(= main_~status~5 0)} assume 0 != ~we_should_unload~0; {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {42817#(= main_~status~5 0)} assume !(1 == ~pended~0); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {42817#(= main_~status~5 0)} assume !(1 == ~pended~0); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {42817#(= main_~status~5 0)} assume !(~s~0 == ~UNLOADED~0); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {42817#(= main_~status~5 0)} assume !(-1 == ~status~5); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {42817#(= main_~status~5 0)} assume !(~s~0 != ~SKIP2~0); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {42817#(= main_~status~5 0)} assume !(1 == ~pended~0); {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {42817#(= main_~status~5 0)} assume ~s~0 == ~DC~0; {42817#(= main_~status~5 0)} is VALID [2022-04-15 11:31:51,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {42817#(= main_~status~5 0)} assume 259 == ~status~5; {42765#false} is VALID [2022-04-15 11:31:51,217 INFO L272 TraceCheckUtils]: 77: Hoare triple {42765#false} call errorFn(); {42765#false} is VALID [2022-04-15 11:31:51,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {42765#false} assume !false; {42765#false} is VALID [2022-04-15 11:31:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847705541] [2022-04-15 11:31:51,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847705541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:51,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:51,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:31:51,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:51,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417959107] [2022-04-15 11:31:51,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417959107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:51,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:51,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:31:51,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525053869] [2022-04-15 11:31:51,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:51,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2022-04-15 11:31:51,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:51,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:51,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:51,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:31:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:51,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:31:51,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:31:51,302 INFO L87 Difference]: Start difference. First operand 334 states and 427 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:31:54,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:56,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:58,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:00,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:05,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:07,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:09,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:11,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:13,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:15,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:20,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:31,497 INFO L93 Difference]: Finished difference Result 475 states and 607 transitions. [2022-04-15 11:32:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 11:32:31,497 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2022-04-15 11:32:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:32:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 510 transitions. [2022-04-15 11:32:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:32:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 510 transitions. [2022-04-15 11:32:31,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 510 transitions. [2022-04-15 11:32:32,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:32,083 INFO L225 Difference]: With dead ends: 475 [2022-04-15 11:32:32,083 INFO L226 Difference]: Without dead ends: 367 [2022-04-15 11:32:32,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:32:32,084 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 462 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 155 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:32,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1016 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2863 Invalid, 9 Unknown, 0 Unchecked, 28.4s Time] [2022-04-15 11:32:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-15 11:32:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 338. [2022-04-15 11:32:32,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:32,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) [2022-04-15 11:32:32,579 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) [2022-04-15 11:32:32,579 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) [2022-04-15 11:32:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:32,584 INFO L93 Difference]: Finished difference Result 367 states and 469 transitions. [2022-04-15 11:32:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 469 transitions. [2022-04-15 11:32:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:32,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:32,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) Second operand 367 states. [2022-04-15 11:32:32,586 INFO L87 Difference]: Start difference. First operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) Second operand 367 states. [2022-04-15 11:32:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:32,594 INFO L93 Difference]: Finished difference Result 367 states and 469 transitions. [2022-04-15 11:32:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 469 transitions. [2022-04-15 11:32:32,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:32,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:32,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:32,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 275 states have internal predecessors, (359), 36 states have call successors, (36), 29 states have call predecessors, (36), 31 states have return successors, (37), 33 states have call predecessors, (37), 31 states have call successors, (37) [2022-04-15 11:32:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 432 transitions. [2022-04-15 11:32:32,604 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 432 transitions. Word has length 79 [2022-04-15 11:32:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:32,604 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 432 transitions. [2022-04-15 11:32:32,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-04-15 11:32:32,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 338 states and 432 transitions. [2022-04-15 11:32:33,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 432 transitions. [2022-04-15 11:32:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 11:32:33,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:33,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:33,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:32:33,393 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2045108737, now seen corresponding path program 1 times [2022-04-15 11:32:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249280520] [2022-04-15 11:32:33,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:32:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2045108737, now seen corresponding path program 2 times [2022-04-15 11:32:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185236715] [2022-04-15 11:32:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {45290#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45237#true} {45237#true} #1270#return; {45237#true} is VALID [2022-04-15 11:32:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:32:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {45291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume true; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} {45237#true} #1216#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:32:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {45237#true} ~cond := #in~cond; {45237#true} is VALID [2022-04-15 11:32:33,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume !(0 == ~cond); {45237#true} is VALID [2022-04-15 11:32:33,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45237#true} {45237#true} #1254#return; {45237#true} is VALID [2022-04-15 11:32:33,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {45292#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L272 TraceCheckUtils]: 1: Hoare triple {45237#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} ~cond := #in~cond; {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {45237#true} assume !(0 == ~cond); {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45237#true} {45237#true} #1254#return; {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {45237#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {45237#true} is VALID [2022-04-15 11:32:33,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,665 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1218#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:32:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {45237#true} is VALID [2022-04-15 11:32:33,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~5); {45237#true} is VALID [2022-04-15 11:32:33,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} #res := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,701 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45237#true} {45237#true} #1176#return; {45237#true} is VALID [2022-04-15 11:32:33,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,702 INFO L272 TraceCheckUtils]: 1: Hoare triple {45237#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:33,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {45237#true} is VALID [2022-04-15 11:32:33,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~5); {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {45237#true} #res := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45237#true} {45237#true} #1176#return; {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {45237#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {45237#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {45237#true} is VALID [2022-04-15 11:32:33,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1220#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:32:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {45303#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1222#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 11:32:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:32:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:33,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {45317#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {45237#true} is VALID [2022-04-15 11:32:33,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume !(0 != ~compRegistered~0); {45237#true} is VALID [2022-04-15 11:32:33,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~16); {45237#true} is VALID [2022-04-15 11:32:33,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {45237#true} assume 1 == ~__BLAST_NONDET~16; {45237#true} is VALID [2022-04-15 11:32:33,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {45237#true} ~returnVal~0 := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {45237#true} assume !(~s~0 == ~NP~0); {45237#true} is VALID [2022-04-15 11:32:33,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {45237#true} assume !(~s~0 == ~MPR1~0); {45237#true} is VALID [2022-04-15 11:32:33,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {45237#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume true; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45316#(<= ~SKIP2~0 ~s~0)} {45237#true} #1268#return; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {45304#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {45237#true} is VALID [2022-04-15 11:32:33,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {45237#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {45237#true} is VALID [2022-04-15 11:32:33,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {45237#true} is VALID [2022-04-15 11:32:33,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {45237#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45237#true} is VALID [2022-04-15 11:32:33,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {45237#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L272 TraceCheckUtils]: 5: Hoare triple {45237#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {45317#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {45317#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {45237#true} assume !(0 != ~compRegistered~0); {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~16); {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {45237#true} assume 1 == ~__BLAST_NONDET~16; {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {45237#true} ~returnVal~0 := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {45237#true} assume !(~s~0 == ~NP~0); {45237#true} is VALID [2022-04-15 11:32:33,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {45237#true} assume !(~s~0 == ~MPR1~0); {45237#true} is VALID [2022-04-15 11:32:33,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {45237#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume true; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45316#(<= ~SKIP2~0 ~s~0)} {45237#true} #1268#return; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume true; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,823 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {45316#(<= ~SKIP2~0 ~s~0)} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1232#return; {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {45237#true} call ULTIMATE.init(); {45290#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:33,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {45290#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45237#true} {45237#true} #1270#return; {45237#true} is VALID [2022-04-15 11:32:33,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {45237#true} call #t~ret213 := main(); {45237#true} is VALID [2022-04-15 11:32:33,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {45237#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {45237#true} is VALID [2022-04-15 11:32:33,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {45237#true} call _BLAST_init(); {45291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:33,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {45291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume true; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,828 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} {45237#true} #1216#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {45292#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:32:33,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {45292#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {45237#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {45237#true} ~cond := #in~cond; {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {45237#true} assume !(0 == ~cond); {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45237#true} {45237#true} #1254#return; {45237#true} is VALID [2022-04-15 11:32:33,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {45237#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {45237#true} is VALID [2022-04-15 11:32:33,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,830 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1218#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,833 INFO L272 TraceCheckUtils]: 23: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:33,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L272 TraceCheckUtils]: 25: Hoare triple {45237#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {45297#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~5); {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {45237#true} #res := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {45237#true} {45237#true} #1176#return; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {45237#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {45237#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {45237#true} is VALID [2022-04-15 11:32:33,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,836 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1220#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,837 INFO L272 TraceCheckUtils]: 36: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} call stub_driver_init(); {45303#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:33,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {45303#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45237#true} is VALID [2022-04-15 11:32:33,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {45237#true} assume true; {45237#true} is VALID [2022-04-15 11:32:33,838 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45237#true} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1222#return; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume !!(~status~5 >= 0); {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume !(0 == ~__BLAST_NONDET~0); {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume !(1 == ~__BLAST_NONDET~0); {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume !(2 == ~__BLAST_NONDET~0); {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume !(3 == ~__BLAST_NONDET~0); {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} assume 4 == ~__BLAST_NONDET~0; {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 11:32:33,842 INFO L272 TraceCheckUtils]: 46: Hoare triple {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} call #t~ret175 := KbFilter_Power(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {45304#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:33,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {45304#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {45237#true} is VALID [2022-04-15 11:32:33,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {45237#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {45237#true} is VALID [2022-04-15 11:32:33,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {45237#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {45237#true} is VALID [2022-04-15 11:32:33,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {45237#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45237#true} is VALID [2022-04-15 11:32:33,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {45237#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L272 TraceCheckUtils]: 52: Hoare triple {45237#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {45317#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {45317#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {45237#true} assume !(0 != ~compRegistered~0); {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {45237#true} assume !(0 == ~__BLAST_NONDET~16); {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {45237#true} assume 1 == ~__BLAST_NONDET~16; {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {45237#true} ~returnVal~0 := -1073741823; {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {45237#true} assume !(~s~0 == ~NP~0); {45237#true} is VALID [2022-04-15 11:32:33,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {45237#true} assume !(~s~0 == ~MPR1~0); {45237#true} is VALID [2022-04-15 11:32:33,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {45237#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume true; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,860 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45316#(<= ~SKIP2~0 ~s~0)} {45237#true} #1268#return; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {45316#(<= ~SKIP2~0 ~s~0)} assume true; {45316#(<= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:32:33,862 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {45316#(<= ~SKIP2~0 ~s~0)} {45245#(and (= 2 ~DC~0) (<= 4 ~SKIP2~0))} #1232#return; {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume -2147483648 <= #t~ret175 && #t~ret175 <= 2147483647;~status~5 := #t~ret175;havoc #t~ret175; {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,863 INFO L290 TraceCheckUtils]: 68: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume 0 != ~we_should_unload~0; {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(1 == ~pended~0); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(1 == ~pended~0); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(~s~0 == ~UNLOADED~0); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(-1 == ~status~5); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(~s~0 != ~SKIP2~0); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume !(1 == ~pended~0); {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} is VALID [2022-04-15 11:32:33,866 INFO L290 TraceCheckUtils]: 75: Hoare triple {45289#(and (= 2 ~DC~0) (not (= 2 ~s~0)))} assume ~s~0 == ~DC~0; {45238#false} is VALID [2022-04-15 11:32:33,866 INFO L290 TraceCheckUtils]: 76: Hoare triple {45238#false} assume 259 == ~status~5; {45238#false} is VALID [2022-04-15 11:32:33,866 INFO L272 TraceCheckUtils]: 77: Hoare triple {45238#false} call errorFn(); {45238#false} is VALID [2022-04-15 11:32:33,866 INFO L290 TraceCheckUtils]: 78: Hoare triple {45238#false} assume !false; {45238#false} is VALID [2022-04-15 11:32:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:32:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:33,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185236715] [2022-04-15 11:32:33,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185236715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:33,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:33,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:32:33,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:33,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249280520] [2022-04-15 11:32:33,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249280520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:33,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:33,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:32:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001291882] [2022-04-15 11:32:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:33,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2022-04-15 11:32:33,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:33,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:33,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:33,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:32:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:32:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:32:33,941 INFO L87 Difference]: Start difference. First operand 338 states and 432 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:36,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:40,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:45,681 INFO L93 Difference]: Finished difference Result 429 states and 546 transitions. [2022-04-15 11:32:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 11:32:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2022-04-15 11:32:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 471 transitions. [2022-04-15 11:32:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 471 transitions. [2022-04-15 11:32:45,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 471 transitions. [2022-04-15 11:32:46,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:46,283 INFO L225 Difference]: With dead ends: 429 [2022-04-15 11:32:46,283 INFO L226 Difference]: Without dead ends: 376 [2022-04-15 11:32:46,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2022-04-15 11:32:46,284 INFO L913 BasicCegarLoop]: 278 mSDtfsCounter, 981 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 314 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:46,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [995 Valid, 581 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1340 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 11:32:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-15 11:32:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 329. [2022-04-15 11:32:46,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:46,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:46,783 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:46,783 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:46,790 INFO L93 Difference]: Finished difference Result 376 states and 482 transitions. [2022-04-15 11:32:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 482 transitions. [2022-04-15 11:32:46,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:46,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:46,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 376 states. [2022-04-15 11:32:46,791 INFO L87 Difference]: Start difference. First operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 376 states. [2022-04-15 11:32:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:46,797 INFO L93 Difference]: Finished difference Result 376 states and 482 transitions. [2022-04-15 11:32:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 482 transitions. [2022-04-15 11:32:46,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:46,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:46,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:46,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 266 states have internal predecessors, (347), 36 states have call successors, (36), 29 states have call predecessors, (36), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 418 transitions. [2022-04-15 11:32:46,803 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 418 transitions. Word has length 79 [2022-04-15 11:32:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:46,804 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 418 transitions. [2022-04-15 11:32:46,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:46,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 418 transitions. [2022-04-15 11:32:47,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 418 transitions. [2022-04-15 11:32:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 11:32:47,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:47,551 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:47,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:32:47,551 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1773831806, now seen corresponding path program 1 times [2022-04-15 11:32:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:47,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126108368] [2022-04-15 11:32:47,552 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:32:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1773831806, now seen corresponding path program 2 times [2022-04-15 11:32:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:47,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581856322] [2022-04-15 11:32:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:47,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {47675#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47627#true} {47627#true} #1270#return; {47627#true} is VALID [2022-04-15 11:32:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:32:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {47676#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47627#true} {47627#true} #1216#return; {47627#true} is VALID [2022-04-15 11:32:47,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:32:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {47627#true} ~cond := #in~cond; {47627#true} is VALID [2022-04-15 11:32:47,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume !(0 == ~cond); {47627#true} is VALID [2022-04-15 11:32:47,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47627#true} {47627#true} #1254#return; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L272 TraceCheckUtils]: 1: Hoare triple {47627#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {47627#true} ~cond := #in~cond; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {47627#true} assume !(0 == ~cond); {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {47627#true} {47627#true} #1254#return; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {47627#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,830 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {47627#true} {47627#true} #1218#return; {47627#true} is VALID [2022-04-15 11:32:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:32:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {47627#true} is VALID [2022-04-15 11:32:47,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume !(0 == ~__BLAST_NONDET~5); {47627#true} is VALID [2022-04-15 11:32:47,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {47627#true} #res := -1073741823; {47627#true} is VALID [2022-04-15 11:32:47,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47627#true} {47627#true} #1176#return; {47627#true} is VALID [2022-04-15 11:32:47,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,870 INFO L272 TraceCheckUtils]: 1: Hoare triple {47627#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {47627#true} assume !(0 == ~__BLAST_NONDET~5); {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {47627#true} #res := -1073741823; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {47627#true} {47627#true} #1176#return; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {47627#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {47627#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47627#true} {47627#true} #1220#return; {47627#true} is VALID [2022-04-15 11:32:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:32:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {47688#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47627#true} {47627#true} #1222#return; {47627#true} is VALID [2022-04-15 11:32:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:32:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {47627#true} is VALID [2022-04-15 11:32:47,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {47627#true} is VALID [2022-04-15 11:32:47,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {47627#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {47627#true} is VALID [2022-04-15 11:32:47,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {47627#true} assume #res.base == dest.base && #res.offset == dest.offset; {47627#true} is VALID [2022-04-15 11:32:47,904 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47627#true} {47627#true} #1186#return; {47627#true} is VALID [2022-04-15 11:32:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 11:32:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {47627#true} is VALID [2022-04-15 11:32:47,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47627#true} {47627#true} #1174#return; {47627#true} is VALID [2022-04-15 11:32:47,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {47627#true} is VALID [2022-04-15 11:32:47,928 INFO L272 TraceCheckUtils]: 1: Hoare triple {47627#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:32:47,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {47627#true} is VALID [2022-04-15 11:32:47,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,928 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47627#true} {47627#true} #1174#return; {47627#true} is VALID [2022-04-15 11:32:47,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {47627#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {47627#true} is VALID [2022-04-15 11:32:47,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,929 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47627#true} {47627#true} #1210#return; {47627#true} is VALID [2022-04-15 11:32:47,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:32:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:47,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {47693#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {47627#true} #1212#return; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {47627#true} call ULTIMATE.init(); {47675#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:47,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {47675#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47627#true} {47627#true} #1270#return; {47627#true} is VALID [2022-04-15 11:32:47,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {47627#true} call #t~ret213 := main(); {47627#true} is VALID [2022-04-15 11:32:47,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {47627#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {47627#true} is VALID [2022-04-15 11:32:47,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {47627#true} call _BLAST_init(); {47676#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:47,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {47676#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,954 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {47627#true} {47627#true} #1216#return; {47627#true} is VALID [2022-04-15 11:32:47,955 INFO L272 TraceCheckUtils]: 10: Hoare triple {47627#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:32:47,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {47627#true} is VALID [2022-04-15 11:32:47,955 INFO L272 TraceCheckUtils]: 12: Hoare triple {47627#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {47627#true} is VALID [2022-04-15 11:32:47,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {47627#true} ~cond := #in~cond; {47627#true} is VALID [2022-04-15 11:32:47,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {47627#true} assume !(0 == ~cond); {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {47627#true} {47627#true} #1254#return; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {47627#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {47627#true} {47627#true} #1218#return; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {47627#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {47627#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {47627#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {47627#true} is VALID [2022-04-15 11:32:47,957 INFO L272 TraceCheckUtils]: 23: Hoare triple {47627#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:47,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L272 TraceCheckUtils]: 25: Hoare triple {47627#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {47682#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {47627#true} assume !(0 == ~__BLAST_NONDET~5); {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {47627#true} #res := -1073741823; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {47627#true} {47627#true} #1176#return; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {47627#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {47627#true} is VALID [2022-04-15 11:32:47,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {47627#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {47627#true} is VALID [2022-04-15 11:32:47,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,960 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {47627#true} {47627#true} #1220#return; {47627#true} is VALID [2022-04-15 11:32:47,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {47627#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {47627#true} is VALID [2022-04-15 11:32:47,960 INFO L272 TraceCheckUtils]: 36: Hoare triple {47627#true} call stub_driver_init(); {47688#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {47688#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47627#true} {47627#true} #1222#return; {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {47627#true} assume !!(~status~5 >= 0); {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {47627#true} assume !(0 == ~__BLAST_NONDET~0); {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {47627#true} assume !(1 == ~__BLAST_NONDET~0); {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {47627#true} assume !(2 == ~__BLAST_NONDET~0); {47627#true} is VALID [2022-04-15 11:32:47,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {47627#true} assume 3 == ~__BLAST_NONDET~0; {47627#true} is VALID [2022-04-15 11:32:47,962 INFO L272 TraceCheckUtils]: 45: Hoare triple {47627#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {47627#true} is VALID [2022-04-15 11:32:47,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {47627#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {47627#true} is VALID [2022-04-15 11:32:47,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {47627#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {47627#true} is VALID [2022-04-15 11:32:47,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {47627#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {47627#true} is VALID [2022-04-15 11:32:47,963 INFO L272 TraceCheckUtils]: 49: Hoare triple {47627#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:32:47,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {47677#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {47627#true} is VALID [2022-04-15 11:32:47,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {47627#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {47627#true} is VALID [2022-04-15 11:32:47,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {47627#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {47627#true} is VALID [2022-04-15 11:32:47,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {47627#true} assume #res.base == dest.base && #res.offset == dest.offset; {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {47627#true} {47627#true} #1186#return; {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {47627#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {47627#true} assume !(~s~0 != ~NP~0); {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {47627#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {47627#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L272 TraceCheckUtils]: 59: Hoare triple {47627#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {47627#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {47627#true} is VALID [2022-04-15 11:32:47,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {47627#true} assume 0 != ~compRegistered~0; {47627#true} is VALID [2022-04-15 11:32:47,965 INFO L272 TraceCheckUtils]: 62: Hoare triple {47627#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:32:47,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {47627#true} is VALID [2022-04-15 11:32:47,966 INFO L272 TraceCheckUtils]: 64: Hoare triple {47627#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:32:47,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {47689#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {47627#true} is VALID [2022-04-15 11:32:47,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,966 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {47627#true} {47627#true} #1174#return; {47627#true} is VALID [2022-04-15 11:32:47,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {47627#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {47627#true} is VALID [2022-04-15 11:32:47,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {47627#true} assume true; {47627#true} is VALID [2022-04-15 11:32:47,967 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {47627#true} {47627#true} #1210#return; {47627#true} is VALID [2022-04-15 11:32:47,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {47627#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {47627#true} is VALID [2022-04-15 11:32:47,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {47627#true} assume -1073741802 == ~compRetStatus~0; {47627#true} is VALID [2022-04-15 11:32:47,968 INFO L272 TraceCheckUtils]: 73: Hoare triple {47627#true} call stubMoreProcessingRequired(); {47693#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:47,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {47693#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,969 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {47627#true} #1212#return; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume 0 == ~__BLAST_NONDET~11; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} ~returnVal2~0 := 0; {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~NP~0); {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 11:32:47,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {47674#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {47628#false} is VALID [2022-04-15 11:32:47,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {47628#false} assume !(~s~0 == ~SKIP1~0); {47628#false} is VALID [2022-04-15 11:32:47,971 INFO L272 TraceCheckUtils]: 82: Hoare triple {47628#false} call errorFn(); {47628#false} is VALID [2022-04-15 11:32:47,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {47628#false} assume !false; {47628#false} is VALID [2022-04-15 11:32:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:32:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:47,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581856322] [2022-04-15 11:32:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581856322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:47,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:32:47,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:47,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126108368] [2022-04-15 11:32:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126108368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:47,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:32:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132372606] [2022-04-15 11:32:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 84 [2022-04-15 11:32:47,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:47,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:32:48,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:48,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:32:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:32:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:32:48,054 INFO L87 Difference]: Start difference. First operand 329 states and 418 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:32:50,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:55,986 INFO L93 Difference]: Finished difference Result 416 states and 527 transitions. [2022-04-15 11:32:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:32:55,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 84 [2022-04-15 11:32:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:32:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 452 transitions. [2022-04-15 11:32:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:32:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 452 transitions. [2022-04-15 11:32:55,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 452 transitions. [2022-04-15 11:32:56,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:56,517 INFO L225 Difference]: With dead ends: 416 [2022-04-15 11:32:56,517 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 11:32:56,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:32:56,518 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 1016 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 362 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:56,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1019 Valid, 491 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 691 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:32:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 11:32:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 327. [2022-04-15 11:32:57,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:57,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:57,039 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:57,039 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:57,062 INFO L93 Difference]: Finished difference Result 357 states and 452 transitions. [2022-04-15 11:32:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 452 transitions. [2022-04-15 11:32:57,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:57,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:57,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 357 states. [2022-04-15 11:32:57,063 INFO L87 Difference]: Start difference. First operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 357 states. [2022-04-15 11:32:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:57,072 INFO L93 Difference]: Finished difference Result 357 states and 452 transitions. [2022-04-15 11:32:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 452 transitions. [2022-04-15 11:32:57,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:57,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:57,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:57,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 261 states have (on average 1.314176245210728) internal successors, (343), 264 states have internal predecessors, (343), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:32:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2022-04-15 11:32:57,082 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 84 [2022-04-15 11:32:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:57,083 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2022-04-15 11:32:57,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:32:57,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 413 transitions. [2022-04-15 11:32:57,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2022-04-15 11:32:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 11:32:57,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:57,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:57,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:32:57,848 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1690581556, now seen corresponding path program 1 times [2022-04-15 11:32:57,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:57,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874488276] [2022-04-15 11:32:57,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:32:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1690581556, now seen corresponding path program 2 times [2022-04-15 11:32:57,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:57,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790276012] [2022-04-15 11:32:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:57,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {49971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49919#true} {49919#true} #1270#return; {49919#true} is VALID [2022-04-15 11:32:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:32:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {49972#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:32:58,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} assume true; {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:32:58,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} {49919#true} #1216#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:32:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#true} ~cond := #in~cond; {49919#true} is VALID [2022-04-15 11:32:58,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume !(0 == ~cond); {49919#true} is VALID [2022-04-15 11:32:58,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49919#true} {49919#true} #1254#return; {49919#true} is VALID [2022-04-15 11:32:58,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {49974#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L272 TraceCheckUtils]: 1: Hoare triple {49919#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} ~cond := #in~cond; {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#true} assume !(0 == ~cond); {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {49919#true} {49919#true} #1254#return; {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {49919#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {49919#true} is VALID [2022-04-15 11:32:58,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,131 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1218#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:32:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:32:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {49919#true} is VALID [2022-04-15 11:32:58,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~5); {49919#true} is VALID [2022-04-15 11:32:58,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} #res := -1073741823; {49919#true} is VALID [2022-04-15 11:32:58,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {49919#true} {49919#true} #1176#return; {49919#true} is VALID [2022-04-15 11:32:58,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,170 INFO L272 TraceCheckUtils]: 1: Hoare triple {49919#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:58,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~5); {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {49919#true} #res := -1073741823; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {49919#true} {49919#true} #1176#return; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {49919#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {49919#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {49919#true} is VALID [2022-04-15 11:32:58,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1220#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:32:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {49985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1222#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 11:32:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:32:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:58,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {49998#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {49919#true} is VALID [2022-04-15 11:32:58,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume !(0 != ~compRegistered~0); {49919#true} is VALID [2022-04-15 11:32:58,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~16); {49919#true} is VALID [2022-04-15 11:32:58,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#true} assume 1 == ~__BLAST_NONDET~16; {49919#true} is VALID [2022-04-15 11:32:58,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {49919#true} ~returnVal~0 := -1073741823; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume !(~s~0 == ~NP~0); {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume ~s~0 == ~MPR1~0; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {49920#false} #res := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {49920#false} assume true; {49920#false} is VALID [2022-04-15 11:32:58,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49920#false} {49919#true} #1268#return; {49920#false} is VALID [2022-04-15 11:32:58,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {49986#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {49919#true} is VALID [2022-04-15 11:32:58,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {49919#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {49919#true} is VALID [2022-04-15 11:32:58,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {49919#true} is VALID [2022-04-15 11:32:58,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {49919#true} is VALID [2022-04-15 11:32:58,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {49919#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {49919#true} is VALID [2022-04-15 11:32:58,281 INFO L272 TraceCheckUtils]: 5: Hoare triple {49919#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {49998#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:58,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {49998#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {49919#true} is VALID [2022-04-15 11:32:58,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {49919#true} assume !(0 != ~compRegistered~0); {49919#true} is VALID [2022-04-15 11:32:58,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~16); {49919#true} is VALID [2022-04-15 11:32:58,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {49919#true} assume 1 == ~__BLAST_NONDET~16; {49919#true} is VALID [2022-04-15 11:32:58,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {49919#true} ~returnVal~0 := -1073741823; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume !(~s~0 == ~NP~0); {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume ~s~0 == ~MPR1~0; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {49920#false} #res := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {49920#false} assume true; {49920#false} is VALID [2022-04-15 11:32:58,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49920#false} {49919#true} #1268#return; {49920#false} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {49920#false} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {49920#false} is VALID [2022-04-15 11:32:58,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {49920#false} assume true; {49920#false} is VALID [2022-04-15 11:32:58,284 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {49920#false} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1232#return; {49920#false} is VALID [2022-04-15 11:32:58,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {49919#true} call ULTIMATE.init(); {49971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:58,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {49971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49919#true} {49919#true} #1270#return; {49919#true} is VALID [2022-04-15 11:32:58,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {49919#true} call #t~ret213 := main(); {49919#true} is VALID [2022-04-15 11:32:58,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {49919#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {49919#true} is VALID [2022-04-15 11:32:58,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {49919#true} call _BLAST_init(); {49972#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:58,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {49972#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:32:58,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} assume true; {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:32:58,288 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {49973#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} {49919#true} #1216#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,289 INFO L272 TraceCheckUtils]: 10: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {49974#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {49974#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {49919#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {49919#true} ~cond := #in~cond; {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {49919#true} assume !(0 == ~cond); {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49919#true} {49919#true} #1254#return; {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {49919#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {49919#true} is VALID [2022-04-15 11:32:58,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,291 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1218#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,294 INFO L272 TraceCheckUtils]: 23: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:58,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L272 TraceCheckUtils]: 25: Hoare triple {49919#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {49979#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~5); {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {49919#true} #res := -1073741823; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {49919#true} {49919#true} #1176#return; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {49919#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {49919#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {49919#true} is VALID [2022-04-15 11:32:58,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,297 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1220#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,299 INFO L272 TraceCheckUtils]: 36: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call stub_driver_init(); {49985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:58,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {49985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {49919#true} is VALID [2022-04-15 11:32:58,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {49919#true} assume true; {49919#true} is VALID [2022-04-15 11:32:58,299 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {49919#true} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1222#return; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !!(~status~5 >= 0); {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(0 == ~__BLAST_NONDET~0); {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(1 == ~__BLAST_NONDET~0); {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(2 == ~__BLAST_NONDET~0); {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(3 == ~__BLAST_NONDET~0); {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume 4 == ~__BLAST_NONDET~0; {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:32:58,303 INFO L272 TraceCheckUtils]: 46: Hoare triple {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret175 := KbFilter_Power(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {49986#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:58,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {49986#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {49919#true} is VALID [2022-04-15 11:32:58,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {49919#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {49919#true} is VALID [2022-04-15 11:32:58,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {49919#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {49919#true} is VALID [2022-04-15 11:32:58,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {49919#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {49919#true} is VALID [2022-04-15 11:32:58,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {49919#true} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {49919#true} is VALID [2022-04-15 11:32:58,305 INFO L272 TraceCheckUtils]: 52: Hoare triple {49919#true} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {49998#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:32:58,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {49998#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {49919#true} is VALID [2022-04-15 11:32:58,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {49919#true} assume !(0 != ~compRegistered~0); {49919#true} is VALID [2022-04-15 11:32:58,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {49919#true} assume !(0 == ~__BLAST_NONDET~16); {49919#true} is VALID [2022-04-15 11:32:58,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {49919#true} assume 1 == ~__BLAST_NONDET~16; {49919#true} is VALID [2022-04-15 11:32:58,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {49919#true} ~returnVal~0 := -1073741823; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume !(~s~0 == ~NP~0); {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume ~s~0 == ~MPR1~0; {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {49999#(<= (+ 1073741823 PoCallDriver_~returnVal~0) 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {49920#false} #res := ~returnVal~0; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {49920#false} assume true; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49920#false} {49919#true} #1268#return; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {49920#false} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {49920#false} assume true; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {49920#false} {49927#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1232#return; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {49920#false} assume -2147483648 <= #t~ret175 && #t~ret175 <= 2147483647;~status~5 := #t~ret175;havoc #t~ret175; {49920#false} is VALID [2022-04-15 11:32:58,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {49920#false} assume 0 != ~we_should_unload~0; {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {49920#false} assume !(1 == ~pended~0); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {49920#false} assume !(1 == ~pended~0); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {49920#false} assume !(~s~0 == ~UNLOADED~0); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {49920#false} assume !(-1 == ~status~5); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {49920#false} assume ~s~0 != ~SKIP2~0; {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {49920#false} assume !(~s~0 != ~IPC~0); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {49920#false} assume !(1 == ~pended~0); {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {49920#false} assume ~s~0 == ~DC~0; {49920#false} is VALID [2022-04-15 11:32:58,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {49920#false} assume 259 == ~status~5; {49920#false} is VALID [2022-04-15 11:32:58,309 INFO L272 TraceCheckUtils]: 78: Hoare triple {49920#false} call errorFn(); {49920#false} is VALID [2022-04-15 11:32:58,309 INFO L290 TraceCheckUtils]: 79: Hoare triple {49920#false} assume !false; {49920#false} is VALID [2022-04-15 11:32:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:32:58,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:58,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790276012] [2022-04-15 11:32:58,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790276012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:58,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:58,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:32:58,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:58,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874488276] [2022-04-15 11:32:58,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874488276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:58,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:58,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:32:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56286672] [2022-04-15 11:32:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2022-04-15 11:32:58,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:58,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:32:58,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:58,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:32:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:32:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:32:58,401 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:33:00,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:05,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:14,839 INFO L93 Difference]: Finished difference Result 371 states and 465 transitions. [2022-04-15 11:33:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:33:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2022-04-15 11:33:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:33:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 400 transitions. [2022-04-15 11:33:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:33:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 400 transitions. [2022-04-15 11:33:14,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 400 transitions. [2022-04-15 11:33:15,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:15,375 INFO L225 Difference]: With dead ends: 371 [2022-04-15 11:33:15,375 INFO L226 Difference]: Without dead ends: 346 [2022-04-15 11:33:15,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-04-15 11:33:15,376 INFO L913 BasicCegarLoop]: 260 mSDtfsCounter, 932 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 297 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:15,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 504 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 885 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 11:33:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-15 11:33:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 326. [2022-04-15 11:33:16,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:16,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:33:16,056 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:33:16,056 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:33:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:16,064 INFO L93 Difference]: Finished difference Result 346 states and 438 transitions. [2022-04-15 11:33:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 438 transitions. [2022-04-15 11:33:16,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:16,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:16,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 346 states. [2022-04-15 11:33:16,065 INFO L87 Difference]: Start difference. First operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) Second operand 346 states. [2022-04-15 11:33:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:16,096 INFO L93 Difference]: Finished difference Result 346 states and 438 transitions. [2022-04-15 11:33:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 438 transitions. [2022-04-15 11:33:16,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:16,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:16,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:16,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 260 states have (on average 1.3115384615384615) internal successors, (341), 263 states have internal predecessors, (341), 35 states have call successors, (35), 29 states have call predecessors, (35), 30 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:33:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 411 transitions. [2022-04-15 11:33:16,105 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 411 transitions. Word has length 80 [2022-04-15 11:33:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:16,105 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 411 transitions. [2022-04-15 11:33:16,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 11:33:16,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 411 transitions. [2022-04-15 11:33:16,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 411 transitions. [2022-04-15 11:33:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 11:33:16,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:16,928 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:16,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:33:16,929 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 664933900, now seen corresponding path program 1 times [2022-04-15 11:33:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:16,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491250927] [2022-04-15 11:33:16,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 664933900, now seen corresponding path program 2 times [2022-04-15 11:33:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620831658] [2022-04-15 11:33:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {52163#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52111#true} {52111#true} #1270#return; {52111#true} is VALID [2022-04-15 11:33:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:33:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {52164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:33:17,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} assume true; {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:33:17,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} {52111#true} #1216#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:33:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {52111#true} ~cond := #in~cond; {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {52111#true} assume !(0 == ~cond); {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52111#true} {52111#true} #1254#return; {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {52166#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L272 TraceCheckUtils]: 1: Hoare triple {52111#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {52111#true} is VALID [2022-04-15 11:33:17,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {52111#true} ~cond := #in~cond; {52111#true} is VALID [2022-04-15 11:33:17,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {52111#true} assume !(0 == ~cond); {52111#true} is VALID [2022-04-15 11:33:17,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,206 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {52111#true} {52111#true} #1254#return; {52111#true} is VALID [2022-04-15 11:33:17,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {52111#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {52111#true} is VALID [2022-04-15 11:33:17,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,207 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1218#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:33:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {52111#true} is VALID [2022-04-15 11:33:17,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {52111#true} assume !(0 == ~__BLAST_NONDET~5); {52111#true} is VALID [2022-04-15 11:33:17,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {52111#true} #res := -1073741823; {52111#true} is VALID [2022-04-15 11:33:17,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,242 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52111#true} {52111#true} #1176#return; {52111#true} is VALID [2022-04-15 11:33:17,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L272 TraceCheckUtils]: 1: Hoare triple {52111#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:17,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {52111#true} assume !(0 == ~__BLAST_NONDET~5); {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {52111#true} #res := -1073741823; {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {52111#true} {52111#true} #1176#return; {52111#true} is VALID [2022-04-15 11:33:17,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {52111#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {52111#true} is VALID [2022-04-15 11:33:17,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {52111#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {52111#true} is VALID [2022-04-15 11:33:17,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1220#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:33:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {52177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1222#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 11:33:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-15 11:33:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:17,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {52192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(1 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 259; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~NP~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~MPR1~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} #res := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume true; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52194#(= ~MPR1~0 |old(~s~0)|)} {52179#(= ~SKIP1~0 ~s~0)} #1268#return; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {52178#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {52111#true} is VALID [2022-04-15 11:33:17,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {52111#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {52111#true} is VALID [2022-04-15 11:33:17,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {52111#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {52111#true} is VALID [2022-04-15 11:33:17,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {52111#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {52179#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:33:17,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {52179#(= ~SKIP1~0 ~s~0)} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {52179#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:33:17,400 INFO L272 TraceCheckUtils]: 5: Hoare triple {52179#(= ~SKIP1~0 ~s~0)} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {52192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:17,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {52192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(1 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 259; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~NP~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~MPR1~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} #res := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume true; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,405 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52194#(= ~MPR1~0 |old(~s~0)|)} {52179#(= ~SKIP1~0 ~s~0)} #1268#return; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {52191#(= ~MPR1~0 ~SKIP1~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {52191#(= ~MPR1~0 ~SKIP1~0)} assume true; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,407 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {52191#(= ~MPR1~0 ~SKIP1~0)} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1232#return; {52112#false} is VALID [2022-04-15 11:33:17,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {52111#true} call ULTIMATE.init(); {52163#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:17,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {52163#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52111#true} {52111#true} #1270#return; {52111#true} is VALID [2022-04-15 11:33:17,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {52111#true} call #t~ret213 := main(); {52111#true} is VALID [2022-04-15 11:33:17,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {52111#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {52111#true} is VALID [2022-04-15 11:33:17,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {52111#true} call _BLAST_init(); {52164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:17,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {52164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:33:17,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} assume true; {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} is VALID [2022-04-15 11:33:17,412 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {52165#(and (<= 5 ~MPR1~0) (= (+ ~SKIP1~0 (- 3)) 0))} {52111#true} #1216#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,413 INFO L272 TraceCheckUtils]: 10: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {52166#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:17,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {52166#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {52111#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {52111#true} ~cond := #in~cond; {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {52111#true} assume !(0 == ~cond); {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52111#true} {52111#true} #1254#return; {52111#true} is VALID [2022-04-15 11:33:17,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {52111#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {52111#true} is VALID [2022-04-15 11:33:17,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,414 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1218#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,417 INFO L272 TraceCheckUtils]: 23: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:17,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,419 INFO L272 TraceCheckUtils]: 25: Hoare triple {52111#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:17,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {52171#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {52111#true} is VALID [2022-04-15 11:33:17,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {52111#true} assume !(0 == ~__BLAST_NONDET~5); {52111#true} is VALID [2022-04-15 11:33:17,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {52111#true} #res := -1073741823; {52111#true} is VALID [2022-04-15 11:33:17,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,419 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {52111#true} {52111#true} #1176#return; {52111#true} is VALID [2022-04-15 11:33:17,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {52111#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {52111#true} is VALID [2022-04-15 11:33:17,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {52111#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {52111#true} is VALID [2022-04-15 11:33:17,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,421 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1220#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,422 INFO L272 TraceCheckUtils]: 36: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call stub_driver_init(); {52177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:17,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {52177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {52111#true} is VALID [2022-04-15 11:33:17,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {52111#true} assume true; {52111#true} is VALID [2022-04-15 11:33:17,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52111#true} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1222#return; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !!(~status~5 >= 0); {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(0 == ~__BLAST_NONDET~0); {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(1 == ~__BLAST_NONDET~0); {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(2 == ~__BLAST_NONDET~0); {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume !(3 == ~__BLAST_NONDET~0); {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} assume 4 == ~__BLAST_NONDET~0; {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} is VALID [2022-04-15 11:33:17,426 INFO L272 TraceCheckUtils]: 46: Hoare triple {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} call #t~ret175 := KbFilter_Power(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {52178#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:17,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {52178#(and (= |old(#length)| |#length|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpStack~4.base, ~irpStack~4.offset;havoc ~devExt~4.base, ~devExt~4.offset;call ~#powerState~0.base, ~#powerState~0.offset := #Ultimate.allocOnStack(4);havoc ~powerType~0;havoc ~tmp~3;call #t~mem123.base, #t~mem123.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~4.base, ~devExt~4.offset := #t~mem123.base, #t~mem123.offset;havoc #t~mem123.base, #t~mem123.offset;call #t~mem124.base, #t~mem124.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~4.base, ~irpStack~4.offset := #t~mem124.base, #t~mem124.offset;havoc #t~mem124.base, #t~mem124.offset;call #t~mem125 := read~int(~irpStack~4.base, 8 + ~irpStack~4.offset, 4);~powerType~0 := #t~mem125;havoc #t~mem125;call #t~mem126 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call #t~mem127 := read~int(~irpStack~4.base, 12 + ~irpStack~4.offset, 4);call write~int(#t~mem126, ~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem127, ~#powerState~0.base, ~#powerState~0.offset, 4);havoc #t~mem126;havoc #t~mem127;call #t~mem128 := read~int(~irpStack~4.base, 1 + ~irpStack~4.offset, 1); {52111#true} is VALID [2022-04-15 11:33:17,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {52111#true} assume 2 == #t~mem128 % 256;havoc #t~mem128; {52111#true} is VALID [2022-04-15 11:33:17,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {52111#true} assume 1 == ~powerType~0;call #t~mem132 := read~int(~#powerState~0.base, ~#powerState~0.offset, 4);call write~int(#t~mem132, ~devExt~4.base, 48 + ~devExt~4.offset, 4);havoc #t~mem132; {52111#true} is VALID [2022-04-15 11:33:17,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {52111#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {52179#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:33:17,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {52179#(= ~SKIP1~0 ~s~0)} call #t~mem133 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem133) % 256 <= 127 then (1 + #t~mem133) % 256 else (1 + #t~mem133) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem133;call #t~mem134.base, #t~mem134.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem134.base, 36 + #t~mem134.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem134.base, #t~mem134.offset;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~devExt~4.base, 8 + ~devExt~4.offset, 4); {52179#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:33:17,429 INFO L272 TraceCheckUtils]: 52: Hoare triple {52179#(= ~SKIP1~0 ~s~0)} call #t~ret136 := PoCallDriver(#t~mem135.base, #t~mem135.offset, ~Irp.base, ~Irp.offset); {52192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:17,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {52192#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet204 && #t~nondet204 <= 2147483647;~__BLAST_NONDET~16 := #t~nondet204;havoc #t~nondet204;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~12; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(0 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(1 == ~__BLAST_NONDET~16); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 259; {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~NP~0); {52193#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {52193#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~MPR1~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} #res := ~returnVal~0; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {52194#(= ~MPR1~0 |old(~s~0)|)} assume true; {52194#(= ~MPR1~0 |old(~s~0)|)} is VALID [2022-04-15 11:33:17,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52194#(= ~MPR1~0 |old(~s~0)|)} {52179#(= ~SKIP1~0 ~s~0)} #1268#return; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {52191#(= ~MPR1~0 ~SKIP1~0)} assume -2147483648 <= #t~ret136 && #t~ret136 <= 2147483647;~tmp~3 := #t~ret136;havoc #t~mem135.base, #t~mem135.offset;havoc #t~ret136;#res := ~tmp~3;call ULTIMATE.dealloc(~#powerState~0.base, ~#powerState~0.offset);havoc ~#powerState~0.base, ~#powerState~0.offset; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {52191#(= ~MPR1~0 ~SKIP1~0)} assume true; {52191#(= ~MPR1~0 ~SKIP1~0)} is VALID [2022-04-15 11:33:17,435 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {52191#(= ~MPR1~0 ~SKIP1~0)} {52119#(and (not (= ~MPR1~0 3)) (= ~SKIP1~0 3))} #1232#return; {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {52112#false} assume -2147483648 <= #t~ret175 && #t~ret175 <= 2147483647;~status~5 := #t~ret175;havoc #t~ret175; {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {52112#false} assume 0 != ~we_should_unload~0; {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {52112#false} assume !(1 == ~pended~0); {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {52112#false} assume !(1 == ~pended~0); {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {52112#false} assume !(~s~0 == ~UNLOADED~0); {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {52112#false} assume !(-1 == ~status~5); {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {52112#false} assume ~s~0 != ~SKIP2~0; {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {52112#false} assume !(~s~0 != ~IPC~0); {52112#false} is VALID [2022-04-15 11:33:17,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {52112#false} assume !(1 == ~pended~0); {52112#false} is VALID [2022-04-15 11:33:17,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {52112#false} assume ~s~0 == ~DC~0; {52112#false} is VALID [2022-04-15 11:33:17,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {52112#false} assume 259 == ~status~5; {52112#false} is VALID [2022-04-15 11:33:17,436 INFO L272 TraceCheckUtils]: 78: Hoare triple {52112#false} call errorFn(); {52112#false} is VALID [2022-04-15 11:33:17,436 INFO L290 TraceCheckUtils]: 79: Hoare triple {52112#false} assume !false; {52112#false} is VALID [2022-04-15 11:33:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620831658] [2022-04-15 11:33:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620831658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:17,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:17,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:33:17,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:17,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491250927] [2022-04-15 11:33:17,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491250927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:17,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:17,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:33:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885608203] [2022-04-15 11:33:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2022-04-15 11:33:17,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:17,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:33:17,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:17,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:33:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:33:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:33:17,522 INFO L87 Difference]: Start difference. First operand 326 states and 411 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:33:19,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:30,921 INFO L93 Difference]: Finished difference Result 353 states and 444 transitions. [2022-04-15 11:33:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:33:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2022-04-15 11:33:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:33:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 402 transitions. [2022-04-15 11:33:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:33:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 402 transitions. [2022-04-15 11:33:30,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 402 transitions. [2022-04-15 11:33:31,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:31,439 INFO L225 Difference]: With dead ends: 353 [2022-04-15 11:33:31,439 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 11:33:31,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2022-04-15 11:33:31,441 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 955 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 317 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:31,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 471 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1407 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:33:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 11:33:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2022-04-15 11:33:31,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:31,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) [2022-04-15 11:33:31,797 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) [2022-04-15 11:33:31,797 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) [2022-04-15 11:33:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:31,799 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2022-04-15 11:33:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2022-04-15 11:33:31,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:31,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:31,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) Second operand 205 states. [2022-04-15 11:33:31,800 INFO L87 Difference]: Start difference. First operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) Second operand 205 states. [2022-04-15 11:33:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:31,804 INFO L93 Difference]: Finished difference Result 205 states and 246 transitions. [2022-04-15 11:33:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2022-04-15 11:33:31,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:31,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:31,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:31,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (22), 20 states have call predecessors, (22), 19 states have call successors, (22) [2022-04-15 11:33:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2022-04-15 11:33:31,808 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 80 [2022-04-15 11:33:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:31,808 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2022-04-15 11:33:31,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 11:33:31,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 220 transitions. [2022-04-15 11:33:32,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2022-04-15 11:33:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 11:33:32,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:32,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:32,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:33:32,386 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1299022194, now seen corresponding path program 1 times [2022-04-15 11:33:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:32,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526378615] [2022-04-15 11:33:32,386 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1299022194, now seen corresponding path program 2 times [2022-04-15 11:33:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:32,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567741591] [2022-04-15 11:33:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:32,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {53776#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53719#true} {53719#true} #1270#return; {53719#true} is VALID [2022-04-15 11:33:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:33:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {53777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53719#true} {53719#true} #1216#return; {53719#true} is VALID [2022-04-15 11:33:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:33:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {53719#true} ~cond := #in~cond; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume !(0 == ~cond); {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53719#true} {53719#true} #1254#return; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L272 TraceCheckUtils]: 1: Hoare triple {53719#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {53719#true} ~cond := #in~cond; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {53719#true} assume !(0 == ~cond); {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,662 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53719#true} {53719#true} #1254#return; {53719#true} is VALID [2022-04-15 11:33:32,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {53719#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {53719#true} is VALID [2022-04-15 11:33:32,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,663 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {53719#true} {53719#true} #1218#return; {53719#true} is VALID [2022-04-15 11:33:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:33:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {53719#true} is VALID [2022-04-15 11:33:32,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume !(0 == ~__BLAST_NONDET~5); {53719#true} is VALID [2022-04-15 11:33:32,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {53719#true} #res := -1073741823; {53719#true} is VALID [2022-04-15 11:33:32,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,712 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53719#true} {53719#true} #1176#return; {53719#true} is VALID [2022-04-15 11:33:32,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,713 INFO L272 TraceCheckUtils]: 1: Hoare triple {53719#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {53719#true} assume !(0 == ~__BLAST_NONDET~5); {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {53719#true} #res := -1073741823; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53719#true} {53719#true} #1176#return; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {53719#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {53719#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53719#true} {53719#true} #1220#return; {53719#true} is VALID [2022-04-15 11:33:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:33:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {53789#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53719#true} {53719#true} #1222#return; {53719#true} is VALID [2022-04-15 11:33:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:33:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {53719#true} is VALID [2022-04-15 11:33:32,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {53719#true} is VALID [2022-04-15 11:33:32,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {53719#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {53719#true} is VALID [2022-04-15 11:33:32,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {53719#true} assume #res.base == dest.base && #res.offset == dest.offset; {53719#true} is VALID [2022-04-15 11:33:32,752 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53719#true} {53719#true} #1186#return; {53719#true} is VALID [2022-04-15 11:33:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:33:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:33:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:32,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {53719#true} is VALID [2022-04-15 11:33:32,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53719#true} {53719#true} #1174#return; {53719#true} is VALID [2022-04-15 11:33:32,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {53719#true} is VALID [2022-04-15 11:33:32,855 INFO L272 TraceCheckUtils]: 1: Hoare triple {53719#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:32,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {53719#true} is VALID [2022-04-15 11:33:32,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,855 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53719#true} {53719#true} #1174#return; {53719#true} is VALID [2022-04-15 11:33:32,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {53719#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {53719#true} is VALID [2022-04-15 11:33:32,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,856 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53719#true} {53719#true} #1210#return; {53719#true} is VALID [2022-04-15 11:33:32,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {53790#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {53719#true} is VALID [2022-04-15 11:33:32,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {53719#true} assume 0 != ~compRegistered~0; {53719#true} is VALID [2022-04-15 11:33:32,857 INFO L272 TraceCheckUtils]: 2: Hoare triple {53719#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:32,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {53719#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53719#true} {53719#true} #1174#return; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {53719#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53719#true} {53719#true} #1210#return; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {53719#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {53719#true} assume !(-1073741802 == ~compRetStatus~0); {53719#true} is VALID [2022-04-15 11:33:32,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {53719#true} assume 0 == ~__BLAST_NONDET~11; {53719#true} is VALID [2022-04-15 11:33:32,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {53719#true} ~returnVal2~0 := 0; {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:33:32,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:33:32,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:33:32,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:33:32,861 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {53719#true} #1192#return; {53774#(= |KbFilter_PnP_#t~ret109| 0)} is VALID [2022-04-15 11:33:32,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {53719#true} call ULTIMATE.init(); {53776#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:32,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {53776#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53719#true} {53719#true} #1270#return; {53719#true} is VALID [2022-04-15 11:33:32,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {53719#true} call #t~ret213 := main(); {53719#true} is VALID [2022-04-15 11:33:32,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {53719#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {53719#true} is VALID [2022-04-15 11:33:32,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {53719#true} call _BLAST_init(); {53777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:32,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {53777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,865 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {53719#true} {53719#true} #1216#return; {53719#true} is VALID [2022-04-15 11:33:32,865 INFO L272 TraceCheckUtils]: 10: Hoare triple {53719#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:32,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {53719#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {53719#true} ~cond := #in~cond; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {53719#true} assume !(0 == ~cond); {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53719#true} {53719#true} #1254#return; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {53719#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {53719#true} {53719#true} #1218#return; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {53719#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {53719#true} is VALID [2022-04-15 11:33:32,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {53719#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {53719#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {53719#true} is VALID [2022-04-15 11:33:32,867 INFO L272 TraceCheckUtils]: 23: Hoare triple {53719#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:32,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L272 TraceCheckUtils]: 25: Hoare triple {53719#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {53783#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {53719#true} assume !(0 == ~__BLAST_NONDET~5); {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {53719#true} #res := -1073741823; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {53719#true} {53719#true} #1176#return; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {53719#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {53719#true} is VALID [2022-04-15 11:33:32,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {53719#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {53719#true} is VALID [2022-04-15 11:33:32,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,870 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {53719#true} {53719#true} #1220#return; {53719#true} is VALID [2022-04-15 11:33:32,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {53719#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {53719#true} is VALID [2022-04-15 11:33:32,870 INFO L272 TraceCheckUtils]: 36: Hoare triple {53719#true} call stub_driver_init(); {53789#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {53789#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {53719#true} {53719#true} #1222#return; {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {53719#true} assume !!(~status~5 >= 0); {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {53719#true} assume !(0 == ~__BLAST_NONDET~0); {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {53719#true} assume !(1 == ~__BLAST_NONDET~0); {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {53719#true} assume !(2 == ~__BLAST_NONDET~0); {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {53719#true} assume 3 == ~__BLAST_NONDET~0; {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L272 TraceCheckUtils]: 45: Hoare triple {53719#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {53719#true} is VALID [2022-04-15 11:33:32,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {53719#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {53719#true} is VALID [2022-04-15 11:33:32,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {53719#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {53719#true} is VALID [2022-04-15 11:33:32,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {53719#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L272 TraceCheckUtils]: 49: Hoare triple {53719#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {53778#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {53719#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {53719#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {53719#true} assume #res.base == dest.base && #res.offset == dest.offset; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {53719#true} {53719#true} #1186#return; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {53719#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {53719#true} assume !(~s~0 != ~NP~0); {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {53719#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {53719#true} is VALID [2022-04-15 11:33:32,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {53719#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {53719#true} is VALID [2022-04-15 11:33:32,874 INFO L272 TraceCheckUtils]: 59: Hoare triple {53719#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {53790#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:32,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {53790#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {53719#true} is VALID [2022-04-15 11:33:32,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {53719#true} assume 0 != ~compRegistered~0; {53719#true} is VALID [2022-04-15 11:33:32,875 INFO L272 TraceCheckUtils]: 62: Hoare triple {53719#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:32,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {53719#true} is VALID [2022-04-15 11:33:32,876 INFO L272 TraceCheckUtils]: 64: Hoare triple {53719#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:32,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {53801#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {53719#true} is VALID [2022-04-15 11:33:32,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,876 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {53719#true} {53719#true} #1174#return; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {53719#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {53719#true} assume true; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {53719#true} {53719#true} #1210#return; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 71: Hoare triple {53719#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {53719#true} assume !(-1073741802 == ~compRetStatus~0); {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {53719#true} assume 0 == ~__BLAST_NONDET~11; {53719#true} is VALID [2022-04-15 11:33:32,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {53719#true} ~returnVal2~0 := 0; {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:33:32,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:33:32,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {53799#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:33:32,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:33:32,879 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53800#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {53719#true} #1192#return; {53774#(= |KbFilter_PnP_#t~ret109| 0)} is VALID [2022-04-15 11:33:32,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {53774#(= |KbFilter_PnP_#t~ret109| 0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {53775#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:33:32,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {53775#(= KbFilter_PnP_~status~3 0)} assume !(259 == ~status~3); {53775#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:33:32,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {53775#(= KbFilter_PnP_~status~3 0)} assume !(~status~3 >= 0); {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {53720#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L272 TraceCheckUtils]: 83: Hoare triple {53720#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {53720#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {53720#false} assume !(~s~0 == ~NP~0); {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L272 TraceCheckUtils]: 86: Hoare triple {53720#false} call errorFn(); {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {53720#false} assume !false; {53720#false} is VALID [2022-04-15 11:33:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:32,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567741591] [2022-04-15 11:33:32,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567741591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:32,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:32,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:33:32,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:32,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526378615] [2022-04-15 11:33:32,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526378615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:32,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:32,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:33:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342438826] [2022-04-15 11:33:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:32,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 88 [2022-04-15 11:33:32,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:32,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:33:32,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:32,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:33:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:33:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:33:32,967 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:33:35,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:41,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:46,552 INFO L93 Difference]: Finished difference Result 300 states and 368 transitions. [2022-04-15 11:33:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:33:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 88 [2022-04-15 11:33:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:33:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 270 transitions. [2022-04-15 11:33:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:33:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 270 transitions. [2022-04-15 11:33:46,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 270 transitions. [2022-04-15 11:33:46,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:46,943 INFO L225 Difference]: With dead ends: 300 [2022-04-15 11:33:46,943 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 11:33:46,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:33:46,944 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 370 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 196 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:46,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 378 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 767 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:33:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 11:33:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 199. [2022-04-15 11:33:47,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:47,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) [2022-04-15 11:33:47,335 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) [2022-04-15 11:33:47,335 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) [2022-04-15 11:33:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,340 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2022-04-15 11:33:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2022-04-15 11:33:47,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:47,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:47,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) Second operand 237 states. [2022-04-15 11:33:47,341 INFO L87 Difference]: Start difference. First operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) Second operand 237 states. [2022-04-15 11:33:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,345 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2022-04-15 11:33:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2022-04-15 11:33:47,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:47,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:47,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:47,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.2236842105263157) internal successors, (186), 155 states have internal predecessors, (186), 23 states have call successors, (23), 21 states have call predecessors, (23), 23 states have return successors, (24), 22 states have call predecessors, (24), 19 states have call successors, (24) [2022-04-15 11:33:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2022-04-15 11:33:47,350 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 88 [2022-04-15 11:33:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:47,350 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2022-04-15 11:33:47,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-04-15 11:33:47,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 233 transitions. [2022-04-15 11:33:47,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-04-15 11:33:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 11:33:47,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:47,960 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:47,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:33:47,961 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1324935307, now seen corresponding path program 1 times [2022-04-15 11:33:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:47,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649351986] [2022-04-15 11:33:47,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1324935307, now seen corresponding path program 2 times [2022-04-15 11:33:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432223271] [2022-04-15 11:33:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {55355#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55299#true} {55299#true} #1270#return; {55299#true} is VALID [2022-04-15 11:33:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:33:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {55356#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55299#true} {55299#true} #1216#return; {55299#true} is VALID [2022-04-15 11:33:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:33:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {55299#true} ~cond := #in~cond; {55299#true} is VALID [2022-04-15 11:33:48,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume !(0 == ~cond); {55299#true} is VALID [2022-04-15 11:33:48,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55299#true} {55299#true} #1254#return; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L272 TraceCheckUtils]: 1: Hoare triple {55299#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {55299#true} ~cond := #in~cond; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {55299#true} assume !(0 == ~cond); {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {55299#true} {55299#true} #1254#return; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {55299#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {55299#true} is VALID [2022-04-15 11:33:48,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,208 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {55299#true} {55299#true} #1218#return; {55299#true} is VALID [2022-04-15 11:33:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:33:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {55299#true} is VALID [2022-04-15 11:33:48,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume !(0 == ~__BLAST_NONDET~5); {55299#true} is VALID [2022-04-15 11:33:48,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {55299#true} #res := -1073741823; {55299#true} is VALID [2022-04-15 11:33:48,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,242 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55299#true} {55299#true} #1176#return; {55299#true} is VALID [2022-04-15 11:33:48,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,244 INFO L272 TraceCheckUtils]: 1: Hoare triple {55299#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:48,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {55299#true} is VALID [2022-04-15 11:33:48,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {55299#true} assume !(0 == ~__BLAST_NONDET~5); {55299#true} is VALID [2022-04-15 11:33:48,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {55299#true} #res := -1073741823; {55299#true} is VALID [2022-04-15 11:33:48,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,245 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55299#true} {55299#true} #1176#return; {55299#true} is VALID [2022-04-15 11:33:48,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {55299#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {55299#true} is VALID [2022-04-15 11:33:48,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {55299#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {55299#true} is VALID [2022-04-15 11:33:48,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1220#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:33:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {55368#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1222#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:33:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {55299#true} is VALID [2022-04-15 11:33:48,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {55299#true} is VALID [2022-04-15 11:33:48,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {55299#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {55299#true} is VALID [2022-04-15 11:33:48,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {55299#true} assume #res.base == dest.base && #res.offset == dest.offset; {55299#true} is VALID [2022-04-15 11:33:48,282 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1186#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:33:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:33:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:48,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {55299#true} is VALID [2022-04-15 11:33:48,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55299#true} {55299#true} #1174#return; {55299#true} is VALID [2022-04-15 11:33:48,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {55299#true} is VALID [2022-04-15 11:33:48,328 INFO L272 TraceCheckUtils]: 1: Hoare triple {55299#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55299#true} {55299#true} #1174#return; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {55299#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {55299#true} {55299#true} #1210#return; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {55369#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {55299#true} is VALID [2022-04-15 11:33:48,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {55299#true} assume 0 != ~compRegistered~0; {55299#true} is VALID [2022-04-15 11:33:48,330 INFO L272 TraceCheckUtils]: 2: Hoare triple {55299#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:48,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {55299#true} is VALID [2022-04-15 11:33:48,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {55299#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:48,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {55299#true} is VALID [2022-04-15 11:33:48,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {55299#true} {55299#true} #1174#return; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {55299#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55299#true} {55299#true} #1210#return; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {55299#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {55299#true} assume !(-1073741802 == ~compRetStatus~0); {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {55299#true} assume 0 == ~__BLAST_NONDET~11; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {55299#true} ~returnVal2~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {55299#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {55299#true} is VALID [2022-04-15 11:33:48,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {55299#true} #res := ~returnVal2~0; {55299#true} is VALID [2022-04-15 11:33:48,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,333 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1192#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {55299#true} call ULTIMATE.init(); {55355#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:48,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {55355#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55299#true} {55299#true} #1270#return; {55299#true} is VALID [2022-04-15 11:33:48,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {55299#true} call #t~ret213 := main(); {55299#true} is VALID [2022-04-15 11:33:48,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {55299#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {55299#true} is VALID [2022-04-15 11:33:48,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {55299#true} call _BLAST_init(); {55356#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:48,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {55356#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,337 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55299#true} {55299#true} #1216#return; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L272 TraceCheckUtils]: 10: Hoare triple {55299#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {55299#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {55299#true} ~cond := #in~cond; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {55299#true} assume !(0 == ~cond); {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {55299#true} {55299#true} #1254#return; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {55299#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {55299#true} is VALID [2022-04-15 11:33:48,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,339 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {55299#true} {55299#true} #1218#return; {55299#true} is VALID [2022-04-15 11:33:48,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {55299#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {55299#true} is VALID [2022-04-15 11:33:48,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {55299#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {55299#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,340 INFO L272 TraceCheckUtils]: 23: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:48,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L272 TraceCheckUtils]: 25: Hoare triple {55299#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {55362#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {55299#true} assume !(0 == ~__BLAST_NONDET~5); {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {55299#true} #res := -1073741823; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {55299#true} {55299#true} #1176#return; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {55299#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {55299#true} is VALID [2022-04-15 11:33:48,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {55299#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {55299#true} is VALID [2022-04-15 11:33:48,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,343 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1220#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,344 INFO L272 TraceCheckUtils]: 36: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call stub_driver_init(); {55368#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:48,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {55368#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,345 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1222#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !!(~status~5 >= 0); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(0 == ~__BLAST_NONDET~0); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(1 == ~__BLAST_NONDET~0); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(2 == ~__BLAST_NONDET~0); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume 3 == ~__BLAST_NONDET~0; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,347 INFO L272 TraceCheckUtils]: 45: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume 0 == #t~mem81 % 256;havoc #t~mem81; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,349 INFO L272 TraceCheckUtils]: 49: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:48,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {55357#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {55299#true} is VALID [2022-04-15 11:33:48,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {55299#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {55299#true} is VALID [2022-04-15 11:33:48,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {55299#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {55299#true} is VALID [2022-04-15 11:33:48,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {55299#true} assume #res.base == dest.base && #res.offset == dest.offset; {55299#true} is VALID [2022-04-15 11:33:48,351 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1186#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(~s~0 != ~NP~0); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,353 INFO L272 TraceCheckUtils]: 59: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {55369#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:48,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {55369#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {55299#true} is VALID [2022-04-15 11:33:48,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {55299#true} assume 0 != ~compRegistered~0; {55299#true} is VALID [2022-04-15 11:33:48,354 INFO L272 TraceCheckUtils]: 62: Hoare triple {55299#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:48,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L272 TraceCheckUtils]: 64: Hoare triple {55299#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {55378#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {55299#true} {55299#true} #1174#return; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {55299#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55299#true} {55299#true} #1210#return; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {55299#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {55299#true} is VALID [2022-04-15 11:33:48,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {55299#true} assume !(-1073741802 == ~compRetStatus~0); {55299#true} is VALID [2022-04-15 11:33:48,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {55299#true} assume 0 == ~__BLAST_NONDET~11; {55299#true} is VALID [2022-04-15 11:33:48,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {55299#true} ~returnVal2~0 := 0; {55299#true} is VALID [2022-04-15 11:33:48,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {55299#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {55299#true} is VALID [2022-04-15 11:33:48,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {55299#true} #res := ~returnVal2~0; {55299#true} is VALID [2022-04-15 11:33:48,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {55299#true} assume true; {55299#true} is VALID [2022-04-15 11:33:48,357 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {55299#true} {55316#(= ~myStatus~0 (- 1073741637))} #1192#return; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume !(259 == ~status~3); {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume ~status~3 >= 0; {55316#(= ~myStatus~0 (- 1073741637))} is VALID [2022-04-15 11:33:48,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {55316#(= ~myStatus~0 (- 1073741637))} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L290 TraceCheckUtils]: 83: Hoare triple {55300#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L272 TraceCheckUtils]: 84: Hoare triple {55300#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {55300#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {55300#false} assume !(~s~0 == ~NP~0); {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L272 TraceCheckUtils]: 87: Hoare triple {55300#false} call errorFn(); {55300#false} is VALID [2022-04-15 11:33:48,359 INFO L290 TraceCheckUtils]: 88: Hoare triple {55300#false} assume !false; {55300#false} is VALID [2022-04-15 11:33:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432223271] [2022-04-15 11:33:48,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432223271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:48,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:48,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:33:48,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:48,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649351986] [2022-04-15 11:33:48,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649351986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:48,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:48,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:33:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750414657] [2022-04-15 11:33:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:48,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-04-15 11:33:48,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:48,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-15 11:33:48,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:48,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:33:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:33:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:33:48,442 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-15 11:33:50,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:56,441 INFO L93 Difference]: Finished difference Result 437 states and 522 transitions. [2022-04-15 11:33:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:33:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-04-15 11:33:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-15 11:33:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 383 transitions. [2022-04-15 11:33:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-15 11:33:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 383 transitions. [2022-04-15 11:33:56,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 383 transitions. [2022-04-15 11:33:56,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:56,926 INFO L225 Difference]: With dead ends: 437 [2022-04-15 11:33:56,926 INFO L226 Difference]: Without dead ends: 408 [2022-04-15 11:33:56,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:33:56,927 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 605 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 283 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:56,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 268 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:33:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-15 11:33:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2022-04-15 11:33:57,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:57,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2022-04-15 11:33:57,630 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2022-04-15 11:33:57,631 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2022-04-15 11:33:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:57,640 INFO L93 Difference]: Finished difference Result 408 states and 489 transitions. [2022-04-15 11:33:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 489 transitions. [2022-04-15 11:33:57,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:57,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:57,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) Second operand 408 states. [2022-04-15 11:33:57,642 INFO L87 Difference]: Start difference. First operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) Second operand 408 states. [2022-04-15 11:33:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:57,651 INFO L93 Difference]: Finished difference Result 408 states and 489 transitions. [2022-04-15 11:33:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 489 transitions. [2022-04-15 11:33:57,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:57,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:57,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:57,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.2350746268656716) internal successors, (331), 272 states have internal predecessors, (331), 36 states have call successors, (36), 34 states have call predecessors, (36), 40 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2022-04-15 11:33:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 409 transitions. [2022-04-15 11:33:57,661 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 409 transitions. Word has length 89 [2022-04-15 11:33:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:57,661 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 409 transitions. [2022-04-15 11:33:57,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (15), 10 states have call predecessors, (15), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-15 11:33:57,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 345 states and 409 transitions. [2022-04-15 11:33:58,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 409 transitions. [2022-04-15 11:33:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 11:33:58,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:58,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:58,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:33:58,601 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 450072055, now seen corresponding path program 1 times [2022-04-15 11:33:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:58,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742210774] [2022-04-15 11:33:58,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 450072055, now seen corresponding path program 2 times [2022-04-15 11:33:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:58,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451789556] [2022-04-15 11:33:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {57845#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57788#true} {57788#true} #1270#return; {57788#true} is VALID [2022-04-15 11:33:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:33:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {57846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57788#true} {57788#true} #1216#return; {57788#true} is VALID [2022-04-15 11:33:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:33:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {57788#true} ~cond := #in~cond; {57788#true} is VALID [2022-04-15 11:33:58,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume !(0 == ~cond); {57788#true} is VALID [2022-04-15 11:33:58,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57788#true} {57788#true} #1254#return; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L272 TraceCheckUtils]: 1: Hoare triple {57788#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {57788#true} ~cond := #in~cond; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#true} assume !(0 == ~cond); {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57788#true} {57788#true} #1254#return; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {57788#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {57788#true} is VALID [2022-04-15 11:33:58,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,826 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {57788#true} {57788#true} #1218#return; {57788#true} is VALID [2022-04-15 11:33:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:33:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {57788#true} is VALID [2022-04-15 11:33:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume !(0 == ~__BLAST_NONDET~5); {57788#true} is VALID [2022-04-15 11:33:58,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {57788#true} #res := -1073741823; {57788#true} is VALID [2022-04-15 11:33:58,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,877 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57788#true} {57788#true} #1176#return; {57788#true} is VALID [2022-04-15 11:33:58,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,878 INFO L272 TraceCheckUtils]: 1: Hoare triple {57788#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:58,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {57788#true} is VALID [2022-04-15 11:33:58,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#true} assume !(0 == ~__BLAST_NONDET~5); {57788#true} is VALID [2022-04-15 11:33:58,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {57788#true} #res := -1073741823; {57788#true} is VALID [2022-04-15 11:33:58,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,879 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57788#true} {57788#true} #1176#return; {57788#true} is VALID [2022-04-15 11:33:58,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {57788#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {57788#true} is VALID [2022-04-15 11:33:58,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {57788#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} is VALID [2022-04-15 11:33:58,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} assume true; {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} is VALID [2022-04-15 11:33:58,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} {57788#true} #1220#return; {57816#(<= (+ 1 |main_#t~ret170|) 0)} is VALID [2022-04-15 11:33:58,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 11:33:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {57859#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57788#true} {57817#(<= (+ main_~status~5 1) 0)} #1222#return; {57817#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:33:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:33:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {57788#true} is VALID [2022-04-15 11:33:58,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {57788#true} is VALID [2022-04-15 11:33:58,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {57788#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {57788#true} is VALID [2022-04-15 11:33:58,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#true} assume #res.base == dest.base && #res.offset == dest.offset; {57788#true} is VALID [2022-04-15 11:33:58,918 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57788#true} {57789#false} #1186#return; {57789#false} is VALID [2022-04-15 11:33:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:33:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:33:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:33:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:58,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {57788#true} is VALID [2022-04-15 11:33:58,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57788#true} {57788#true} #1174#return; {57788#true} is VALID [2022-04-15 11:33:58,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {57788#true} is VALID [2022-04-15 11:33:58,967 INFO L272 TraceCheckUtils]: 1: Hoare triple {57788#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57788#true} {57788#true} #1174#return; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {57788#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57788#true} {57788#true} #1210#return; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {57860#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {57788#true} is VALID [2022-04-15 11:33:58,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {57788#true} assume 0 != ~compRegistered~0; {57788#true} is VALID [2022-04-15 11:33:58,969 INFO L272 TraceCheckUtils]: 2: Hoare triple {57788#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:58,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {57788#true} is VALID [2022-04-15 11:33:58,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {57788#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:58,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {57788#true} is VALID [2022-04-15 11:33:58,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,970 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57788#true} {57788#true} #1174#return; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {57788#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57788#true} {57788#true} #1210#return; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {57788#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {57788#true} assume !(-1073741802 == ~compRetStatus~0); {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {57788#true} assume 0 == ~__BLAST_NONDET~11; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {57788#true} ~returnVal2~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {57788#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {57788#true} #res := ~returnVal2~0; {57788#true} is VALID [2022-04-15 11:33:58,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,972 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {57788#true} {57789#false} #1192#return; {57789#false} is VALID [2022-04-15 11:33:58,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {57788#true} call ULTIMATE.init(); {57845#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:58,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {57845#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57788#true} {57788#true} #1270#return; {57788#true} is VALID [2022-04-15 11:33:58,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {57788#true} call #t~ret213 := main(); {57788#true} is VALID [2022-04-15 11:33:58,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {57788#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {57788#true} is VALID [2022-04-15 11:33:58,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {57788#true} call _BLAST_init(); {57846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:58,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {57846#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,975 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {57788#true} {57788#true} #1216#return; {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L272 TraceCheckUtils]: 10: Hoare triple {57788#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:58,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {57788#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {57788#true} ~cond := #in~cond; {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {57788#true} assume !(0 == ~cond); {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,976 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57788#true} {57788#true} #1254#return; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {57788#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {57788#true} {57788#true} #1218#return; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {57788#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {57788#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {57788#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {57788#true} is VALID [2022-04-15 11:33:58,978 INFO L272 TraceCheckUtils]: 23: Hoare triple {57788#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:58,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L272 TraceCheckUtils]: 25: Hoare triple {57788#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:33:58,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {57852#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {57788#true} assume !(0 == ~__BLAST_NONDET~5); {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {57788#true} #res := -1073741823; {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {57788#true} {57788#true} #1176#return; {57788#true} is VALID [2022-04-15 11:33:58,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {57788#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {57788#true} is VALID [2022-04-15 11:33:58,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {57788#true} assume !(~status~0 >= 0);#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} is VALID [2022-04-15 11:33:58,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} assume true; {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} is VALID [2022-04-15 11:33:58,982 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {57858#(<= (+ |KbFilter_AddDevice_#res| 1) 0)} {57788#true} #1220#return; {57816#(<= (+ 1 |main_#t~ret170|) 0)} is VALID [2022-04-15 11:33:58,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {57816#(<= (+ 1 |main_#t~ret170|) 0)} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {57817#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:33:58,983 INFO L272 TraceCheckUtils]: 36: Hoare triple {57817#(<= (+ main_~status~5 1) 0)} call stub_driver_init(); {57859#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:58,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {57859#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,984 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {57788#true} {57817#(<= (+ main_~status~5 1) 0)} #1222#return; {57817#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:33:58,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {57817#(<= (+ main_~status~5 1) 0)} assume !!(~status~5 >= 0); {57789#false} is VALID [2022-04-15 11:33:58,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {57789#false} assume !(0 == ~__BLAST_NONDET~0); {57789#false} is VALID [2022-04-15 11:33:58,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {57789#false} assume !(1 == ~__BLAST_NONDET~0); {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {57789#false} assume !(2 == ~__BLAST_NONDET~0); {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {57789#false} assume 3 == ~__BLAST_NONDET~0; {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L272 TraceCheckUtils]: 45: Hoare triple {57789#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {57789#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {57789#false} assume 0 == #t~mem81 % 256;havoc #t~mem81; {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {57789#false} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {57789#false} is VALID [2022-04-15 11:33:58,985 INFO L272 TraceCheckUtils]: 49: Hoare triple {57789#false} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {57847#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {57788#true} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {57788#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {57788#true} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {57788#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {57788#true} is VALID [2022-04-15 11:33:58,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {57788#true} assume #res.base == dest.base && #res.offset == dest.offset; {57788#true} is VALID [2022-04-15 11:33:58,986 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {57788#true} {57789#false} #1186#return; {57789#false} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {57789#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {57789#false} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {57789#false} assume !(~s~0 != ~NP~0); {57789#false} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {57789#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {57789#false} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {57789#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {57789#false} is VALID [2022-04-15 11:33:58,986 INFO L272 TraceCheckUtils]: 59: Hoare triple {57789#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {57860#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {57860#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {57788#true} is VALID [2022-04-15 11:33:58,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {57788#true} assume 0 != ~compRegistered~0; {57788#true} is VALID [2022-04-15 11:33:58,987 INFO L272 TraceCheckUtils]: 62: Hoare triple {57788#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:58,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {57788#true} is VALID [2022-04-15 11:33:58,988 INFO L272 TraceCheckUtils]: 64: Hoare triple {57788#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:33:58,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {57869#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {57788#true} is VALID [2022-04-15 11:33:58,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,988 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {57788#true} {57788#true} #1174#return; {57788#true} is VALID [2022-04-15 11:33:58,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {57788#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {57788#true} {57788#true} #1210#return; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {57788#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {57788#true} assume !(-1073741802 == ~compRetStatus~0); {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {57788#true} assume 0 == ~__BLAST_NONDET~11; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {57788#true} ~returnVal2~0 := 0; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {57788#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {57788#true} #res := ~returnVal2~0; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {57788#true} assume true; {57788#true} is VALID [2022-04-15 11:33:58,989 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {57788#true} {57789#false} #1192#return; {57789#false} is VALID [2022-04-15 11:33:58,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {57789#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {57789#false} assume !(259 == ~status~3); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 81: Hoare triple {57789#false} assume ~status~3 >= 0; {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {57789#false} assume !(~myStatus~0 >= 0); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {57789#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L272 TraceCheckUtils]: 84: Hoare triple {57789#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {57789#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 86: Hoare triple {57789#false} assume !(~s~0 == ~NP~0); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L272 TraceCheckUtils]: 87: Hoare triple {57789#false} call errorFn(); {57789#false} is VALID [2022-04-15 11:33:58,990 INFO L290 TraceCheckUtils]: 88: Hoare triple {57789#false} assume !false; {57789#false} is VALID [2022-04-15 11:33:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451789556] [2022-04-15 11:33:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451789556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:58,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:58,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:33:58,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742210774] [2022-04-15 11:33:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742210774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:33:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299823039] [2022-04-15 11:33:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2022-04-15 11:33:58,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:58,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 11:33:59,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:59,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:33:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:33:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:33:59,080 INFO L87 Difference]: Start difference. First operand 345 states and 409 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 11:34:01,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:08,974 INFO L93 Difference]: Finished difference Result 657 states and 796 transitions. [2022-04-15 11:34:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:34:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2022-04-15 11:34:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 11:34:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 311 transitions. [2022-04-15 11:34:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 11:34:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 311 transitions. [2022-04-15 11:34:08,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 311 transitions. [2022-04-15 11:34:09,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:09,304 INFO L225 Difference]: With dead ends: 657 [2022-04-15 11:34:09,305 INFO L226 Difference]: Without dead ends: 399 [2022-04-15 11:34:09,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:34:09,305 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 208 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 121 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:09,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 379 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 674 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 11:34:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-15 11:34:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 337. [2022-04-15 11:34:09,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:09,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:09,971 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:09,971 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:09,979 INFO L93 Difference]: Finished difference Result 399 states and 479 transitions. [2022-04-15 11:34:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 479 transitions. [2022-04-15 11:34:09,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:09,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:09,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 399 states. [2022-04-15 11:34:09,981 INFO L87 Difference]: Start difference. First operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 399 states. [2022-04-15 11:34:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:09,990 INFO L93 Difference]: Finished difference Result 399 states and 479 transitions. [2022-04-15 11:34:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 479 transitions. [2022-04-15 11:34:09,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:09,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:09,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:09,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.2328244274809161) internal successors, (323), 266 states have internal predecessors, (323), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 399 transitions. [2022-04-15 11:34:09,998 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 399 transitions. Word has length 89 [2022-04-15 11:34:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:09,998 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 399 transitions. [2022-04-15 11:34:09,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (15), 9 states have call predecessors, (15), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 11:34:09,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 399 transitions. [2022-04-15 11:34:10,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 399 transitions. [2022-04-15 11:34:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 11:34:10,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:10,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:10,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:34:10,902 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -623916271, now seen corresponding path program 1 times [2022-04-15 11:34:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:10,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291241424] [2022-04-15 11:34:10,903 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:34:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash -623916271, now seen corresponding path program 2 times [2022-04-15 11:34:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:10,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63460422] [2022-04-15 11:34:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {60739#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60671#true} {60671#true} #1270#return; {60671#true} is VALID [2022-04-15 11:34:11,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:34:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {60740#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60671#true} {60671#true} #1216#return; {60671#true} is VALID [2022-04-15 11:34:11,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:34:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {60671#true} ~cond := #in~cond; {60671#true} is VALID [2022-04-15 11:34:11,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume !(0 == ~cond); {60671#true} is VALID [2022-04-15 11:34:11,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60671#true} {60671#true} #1254#return; {60671#true} is VALID [2022-04-15 11:34:11,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L272 TraceCheckUtils]: 1: Hoare triple {60671#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} ~cond := #in~cond; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume !(0 == ~cond); {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {60671#true} {60671#true} #1254#return; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {60671#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,401 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {60671#true} {60671#true} #1218#return; {60671#true} is VALID [2022-04-15 11:34:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:34:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {60671#true} is VALID [2022-04-15 11:34:11,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~5; {60671#true} is VALID [2022-04-15 11:34:11,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {60671#true} is VALID [2022-04-15 11:34:11,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,487 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60671#true} {60671#true} #1176#return; {60671#true} is VALID [2022-04-15 11:34:11,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:34:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:11,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} {60671#true} #1178#return; {60672#false} is VALID [2022-04-15 11:34:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 11:34:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {60671#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {60671#true} is VALID [2022-04-15 11:34:11,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~2; {60671#true} is VALID [2022-04-15 11:34:11,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {60671#true} is VALID [2022-04-15 11:34:11,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,563 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60671#true} {60672#false} #1180#return; {60672#false} is VALID [2022-04-15 11:34:11,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,564 INFO L272 TraceCheckUtils]: 1: Hoare triple {60671#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:11,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {60671#true} is VALID [2022-04-15 11:34:11,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~5; {60671#true} is VALID [2022-04-15 11:34:11,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {60671#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {60671#true} is VALID [2022-04-15 11:34:11,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,565 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {60671#true} {60671#true} #1176#return; {60671#true} is VALID [2022-04-15 11:34:11,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {60671#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {60671#true} is VALID [2022-04-15 11:34:11,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {60671#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {60671#true} is VALID [2022-04-15 11:34:11,566 INFO L272 TraceCheckUtils]: 9: Hoare triple {60671#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:11,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:11,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,568 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} {60671#true} #1178#return; {60672#false} is VALID [2022-04-15 11:34:11,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {60672#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {60672#false} is VALID [2022-04-15 11:34:11,569 INFO L272 TraceCheckUtils]: 15: Hoare triple {60672#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {60671#true} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {60671#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {60671#true} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~2; {60671#true} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {60671#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {60671#true} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,569 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {60671#true} {60672#false} #1180#return; {60672#false} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {60672#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {60672#false} is VALID [2022-04-15 11:34:11,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {60672#false} assume true; {60672#false} is VALID [2022-04-15 11:34:11,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60672#false} {60671#true} #1220#return; {60672#false} is VALID [2022-04-15 11:34:11,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 11:34:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {60763#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60671#true} {60672#false} #1222#return; {60672#false} is VALID [2022-04-15 11:34:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 11:34:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {60671#true} is VALID [2022-04-15 11:34:11,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {60671#true} is VALID [2022-04-15 11:34:11,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {60671#true} is VALID [2022-04-15 11:34:11,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume #res.base == dest.base && #res.offset == dest.offset; {60671#true} is VALID [2022-04-15 11:34:11,602 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60671#true} {60672#false} #1186#return; {60672#false} is VALID [2022-04-15 11:34:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 11:34:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:34:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:11,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {60671#true} is VALID [2022-04-15 11:34:11,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60671#true} {60671#true} #1174#return; {60671#true} is VALID [2022-04-15 11:34:11,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {60671#true} is VALID [2022-04-15 11:34:11,649 INFO L272 TraceCheckUtils]: 1: Hoare triple {60671#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:11,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {60671#true} is VALID [2022-04-15 11:34:11,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,649 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60671#true} {60671#true} #1174#return; {60671#true} is VALID [2022-04-15 11:34:11,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {60671#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {60671#true} is VALID [2022-04-15 11:34:11,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,650 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60671#true} {60671#true} #1210#return; {60671#true} is VALID [2022-04-15 11:34:11,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {60764#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {60671#true} is VALID [2022-04-15 11:34:11,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {60671#true} assume 0 != ~compRegistered~0; {60671#true} is VALID [2022-04-15 11:34:11,651 INFO L272 TraceCheckUtils]: 2: Hoare triple {60671#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:11,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {60671#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60671#true} {60671#true} #1174#return; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {60671#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60671#true} {60671#true} #1210#return; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {60671#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {60671#true} assume !(-1073741802 == ~compRetStatus~0); {60671#true} is VALID [2022-04-15 11:34:11,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~11; {60671#true} is VALID [2022-04-15 11:34:11,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {60671#true} ~returnVal2~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {60671#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {60671#true} is VALID [2022-04-15 11:34:11,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {60671#true} #res := ~returnVal2~0; {60671#true} is VALID [2022-04-15 11:34:11,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,653 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {60671#true} {60672#false} #1192#return; {60672#false} is VALID [2022-04-15 11:34:11,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {60671#true} call ULTIMATE.init(); {60739#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:11,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {60739#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60671#true} {60671#true} #1270#return; {60671#true} is VALID [2022-04-15 11:34:11,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {60671#true} call #t~ret213 := main(); {60671#true} is VALID [2022-04-15 11:34:11,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {60671#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {60671#true} is VALID [2022-04-15 11:34:11,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {60671#true} call _BLAST_init(); {60740#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:11,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {60740#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,664 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {60671#true} {60671#true} #1216#return; {60671#true} is VALID [2022-04-15 11:34:11,665 INFO L272 TraceCheckUtils]: 10: Hoare triple {60671#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:11,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L272 TraceCheckUtils]: 12: Hoare triple {60671#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {60671#true} ~cond := #in~cond; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {60671#true} assume !(0 == ~cond); {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60671#true} {60671#true} #1254#return; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {60671#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {60671#true} {60671#true} #1218#return; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {60671#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {60671#true} is VALID [2022-04-15 11:34:11,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {60671#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {60671#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {60671#true} is VALID [2022-04-15 11:34:11,668 INFO L272 TraceCheckUtils]: 23: Hoare triple {60671#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:11,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,669 INFO L272 TraceCheckUtils]: 25: Hoare triple {60671#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:11,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {60746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {60671#true} is VALID [2022-04-15 11:34:11,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~5; {60671#true} is VALID [2022-04-15 11:34:11,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {60671#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {60671#true} is VALID [2022-04-15 11:34:11,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,670 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60671#true} {60671#true} #1176#return; {60671#true} is VALID [2022-04-15 11:34:11,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {60671#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {60671#true} is VALID [2022-04-15 11:34:11,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {60671#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {60671#true} is VALID [2022-04-15 11:34:11,670 INFO L272 TraceCheckUtils]: 33: Hoare triple {60671#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:11,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:11,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {60761#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-04-15 11:34:11,673 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {60762#(or (<= |#Ultimate.C_memset_#amount| 0) (< 0 (div |#Ultimate.C_memset_#amount| 4294967296)))} {60671#true} #1178#return; {60672#false} is VALID [2022-04-15 11:34:11,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {60672#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {60672#false} is VALID [2022-04-15 11:34:11,673 INFO L272 TraceCheckUtils]: 39: Hoare triple {60672#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {60671#true} is VALID [2022-04-15 11:34:11,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {60671#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {60671#true} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~2; {60671#true} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {60671#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {60671#true} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,674 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {60671#true} {60672#false} #1180#return; {60672#false} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {60672#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {60672#false} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {60672#false} assume true; {60672#false} is VALID [2022-04-15 11:34:11,674 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60672#false} {60671#true} #1220#return; {60672#false} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {60672#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {60672#false} is VALID [2022-04-15 11:34:11,674 INFO L272 TraceCheckUtils]: 49: Hoare triple {60672#false} call stub_driver_init(); {60763#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:11,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {60763#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,675 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {60671#true} {60672#false} #1222#return; {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {60672#false} assume !!(~status~5 >= 0); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {60672#false} assume !(0 == ~__BLAST_NONDET~0); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {60672#false} assume !(1 == ~__BLAST_NONDET~0); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {60672#false} assume !(2 == ~__BLAST_NONDET~0); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {60672#false} assume 3 == ~__BLAST_NONDET~0; {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L272 TraceCheckUtils]: 58: Hoare triple {60672#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {60672#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {60672#false} is VALID [2022-04-15 11:34:11,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {60672#false} assume 0 == #t~mem81 % 256;havoc #t~mem81; {60672#false} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {60672#false} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {60672#false} is VALID [2022-04-15 11:34:11,676 INFO L272 TraceCheckUtils]: 62: Hoare triple {60672#false} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {60741#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {60671#true} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {60671#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {60671#true} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 65: Hoare triple {60671#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {60671#true} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {60671#true} assume #res.base == dest.base && #res.offset == dest.offset; {60671#true} is VALID [2022-04-15 11:34:11,676 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {60671#true} {60672#false} #1186#return; {60672#false} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {60672#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {60672#false} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {60672#false} assume !(~s~0 != ~NP~0); {60672#false} is VALID [2022-04-15 11:34:11,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {60672#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {60672#false} is VALID [2022-04-15 11:34:11,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {60672#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {60672#false} is VALID [2022-04-15 11:34:11,677 INFO L272 TraceCheckUtils]: 72: Hoare triple {60672#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {60764#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:11,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {60764#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {60671#true} is VALID [2022-04-15 11:34:11,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {60671#true} assume 0 != ~compRegistered~0; {60671#true} is VALID [2022-04-15 11:34:11,678 INFO L272 TraceCheckUtils]: 75: Hoare triple {60671#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:11,678 INFO L290 TraceCheckUtils]: 76: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L272 TraceCheckUtils]: 77: Hoare triple {60671#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:11,679 INFO L290 TraceCheckUtils]: 78: Hoare triple {60773#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L290 TraceCheckUtils]: 79: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {60671#true} {60671#true} #1174#return; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L290 TraceCheckUtils]: 81: Hoare triple {60671#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L290 TraceCheckUtils]: 82: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {60671#true} {60671#true} #1210#return; {60671#true} is VALID [2022-04-15 11:34:11,679 INFO L290 TraceCheckUtils]: 84: Hoare triple {60671#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {60671#true} assume !(-1073741802 == ~compRetStatus~0); {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {60671#true} assume 0 == ~__BLAST_NONDET~11; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {60671#true} ~returnVal2~0 := 0; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {60671#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {60671#true} #res := ~returnVal2~0; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {60671#true} assume true; {60671#true} is VALID [2022-04-15 11:34:11,680 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {60671#true} {60672#false} #1192#return; {60672#false} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 92: Hoare triple {60672#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {60672#false} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {60672#false} assume !(259 == ~status~3); {60672#false} is VALID [2022-04-15 11:34:11,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {60672#false} assume ~status~3 >= 0; {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L290 TraceCheckUtils]: 95: Hoare triple {60672#false} assume !(~myStatus~0 >= 0); {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {60672#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L272 TraceCheckUtils]: 97: Hoare triple {60672#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L290 TraceCheckUtils]: 98: Hoare triple {60672#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L290 TraceCheckUtils]: 99: Hoare triple {60672#false} assume !(~s~0 == ~NP~0); {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L272 TraceCheckUtils]: 100: Hoare triple {60672#false} call errorFn(); {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L290 TraceCheckUtils]: 101: Hoare triple {60672#false} assume !false; {60672#false} is VALID [2022-04-15 11:34:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:34:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63460422] [2022-04-15 11:34:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63460422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:11,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:11,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:11,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291241424] [2022-04-15 11:34:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291241424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:11,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:11,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157601135] [2022-04-15 11:34:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2022-04-15 11:34:11,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:11,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 11:34:11,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:11,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:34:11,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:34:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:34:11,768 INFO L87 Difference]: Start difference. First operand 337 states and 399 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 11:34:13,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:19,646 INFO L93 Difference]: Finished difference Result 675 states and 810 transitions. [2022-04-15 11:34:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:34:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2022-04-15 11:34:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 11:34:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 318 transitions. [2022-04-15 11:34:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 11:34:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 318 transitions. [2022-04-15 11:34:19,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 318 transitions. [2022-04-15 11:34:19,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:19,967 INFO L225 Difference]: With dead ends: 675 [2022-04-15 11:34:19,967 INFO L226 Difference]: Without dead ends: 389 [2022-04-15 11:34:19,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:34:19,968 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 203 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:19,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 343 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 510 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:34:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-15 11:34:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 339. [2022-04-15 11:34:20,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:20,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:20,711 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:20,712 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:20,719 INFO L93 Difference]: Finished difference Result 389 states and 463 transitions. [2022-04-15 11:34:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 463 transitions. [2022-04-15 11:34:20,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:20,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:20,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 389 states. [2022-04-15 11:34:20,720 INFO L87 Difference]: Start difference. First operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 389 states. [2022-04-15 11:34:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:20,728 INFO L93 Difference]: Finished difference Result 389 states and 463 transitions. [2022-04-15 11:34:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 463 transitions. [2022-04-15 11:34:20,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:20,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:20,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:20,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 264 states have (on average 1.231060606060606) internal successors, (325), 268 states have internal predecessors, (325), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 401 transitions. [2022-04-15 11:34:20,736 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 401 transitions. Word has length 102 [2022-04-15 11:34:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:20,737 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 401 transitions. [2022-04-15 11:34:20,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 9 states have call predecessors, (17), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-15 11:34:20,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 401 transitions. [2022-04-15 11:34:21,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 401 transitions. [2022-04-15 11:34:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 11:34:21,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:21,675 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:21,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:34:21,676 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1023672093, now seen corresponding path program 1 times [2022-04-15 11:34:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:21,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813606899] [2022-04-15 11:34:21,688 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:34:21,688 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:34:21,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1023672093, now seen corresponding path program 2 times [2022-04-15 11:34:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:21,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405749660] [2022-04-15 11:34:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {63666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63597#true} {63597#true} #1270#return; {63597#true} is VALID [2022-04-15 11:34:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:34:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {63667#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63597#true} {63597#true} #1216#return; {63597#true} is VALID [2022-04-15 11:34:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:34:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {63597#true} ~cond := #in~cond; {63597#true} is VALID [2022-04-15 11:34:22,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume !(0 == ~cond); {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63597#true} {63597#true} #1254#return; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L272 TraceCheckUtils]: 1: Hoare triple {63597#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} ~cond := #in~cond; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume !(0 == ~cond); {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63597#true} {63597#true} #1254#return; {63597#true} is VALID [2022-04-15 11:34:22,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {63597#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:22,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,194 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {63597#true} {63597#true} #1218#return; {63597#true} is VALID [2022-04-15 11:34:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:34:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {63597#true} is VALID [2022-04-15 11:34:22,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~5; {63597#true} is VALID [2022-04-15 11:34:22,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:22,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,262 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63597#true} {63597#true} #1176#return; {63597#true} is VALID [2022-04-15 11:34:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:34:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:22,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:34:22,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,371 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {63597#true} #1178#return; {63598#false} is VALID [2022-04-15 11:34:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:34:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {63597#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {63597#true} is VALID [2022-04-15 11:34:22,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~2; {63597#true} is VALID [2022-04-15 11:34:22,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {63597#true} is VALID [2022-04-15 11:34:22,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,380 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63597#true} {63598#false} #1180#return; {63598#false} is VALID [2022-04-15 11:34:22,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,382 INFO L272 TraceCheckUtils]: 1: Hoare triple {63597#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:22,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {63597#true} is VALID [2022-04-15 11:34:22,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~5; {63597#true} is VALID [2022-04-15 11:34:22,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {63597#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:22,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,383 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {63597#true} {63597#true} #1176#return; {63597#true} is VALID [2022-04-15 11:34:22,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {63597#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {63597#true} is VALID [2022-04-15 11:34:22,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {63597#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {63597#true} is VALID [2022-04-15 11:34:22,384 INFO L272 TraceCheckUtils]: 9: Hoare triple {63597#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:22,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:22,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:34:22,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,389 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {63597#true} #1178#return; {63598#false} is VALID [2022-04-15 11:34:22,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {63598#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {63598#false} is VALID [2022-04-15 11:34:22,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {63598#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {63597#true} is VALID [2022-04-15 11:34:22,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {63597#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {63597#true} is VALID [2022-04-15 11:34:22,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~2; {63597#true} is VALID [2022-04-15 11:34:22,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {63597#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {63597#true} is VALID [2022-04-15 11:34:22,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,390 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {63597#true} {63598#false} #1180#return; {63598#false} is VALID [2022-04-15 11:34:22,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {63598#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {63598#false} is VALID [2022-04-15 11:34:22,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {63598#false} assume true; {63598#false} is VALID [2022-04-15 11:34:22,390 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {63598#false} {63597#true} #1220#return; {63598#false} is VALID [2022-04-15 11:34:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:34:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {63692#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63597#true} {63598#false} #1222#return; {63598#false} is VALID [2022-04-15 11:34:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:34:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {63597#true} is VALID [2022-04-15 11:34:22,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {63597#true} is VALID [2022-04-15 11:34:22,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {63597#true} is VALID [2022-04-15 11:34:22,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume #res.base == dest.base && #res.offset == dest.offset; {63597#true} is VALID [2022-04-15 11:34:22,430 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63597#true} {63598#false} #1186#return; {63598#false} is VALID [2022-04-15 11:34:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:34:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:34:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:22,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {63597#true} is VALID [2022-04-15 11:34:22,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63597#true} {63597#true} #1174#return; {63597#true} is VALID [2022-04-15 11:34:22,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {63597#true} is VALID [2022-04-15 11:34:22,482 INFO L272 TraceCheckUtils]: 1: Hoare triple {63597#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:22,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {63597#true} is VALID [2022-04-15 11:34:22,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,482 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {63597#true} {63597#true} #1174#return; {63597#true} is VALID [2022-04-15 11:34:22,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {63597#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {63597#true} is VALID [2022-04-15 11:34:22,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,483 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63597#true} {63597#true} #1210#return; {63597#true} is VALID [2022-04-15 11:34:22,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {63693#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {63597#true} is VALID [2022-04-15 11:34:22,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} assume 0 != ~compRegistered~0; {63597#true} is VALID [2022-04-15 11:34:22,484 INFO L272 TraceCheckUtils]: 2: Hoare triple {63597#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:22,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {63597#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {63597#true} {63597#true} #1174#return; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {63597#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63597#true} {63597#true} #1210#return; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {63597#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {63597#true} is VALID [2022-04-15 11:34:22,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {63597#true} assume !(-1073741802 == ~compRetStatus~0); {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~11; {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {63597#true} ~returnVal2~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {63597#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {63597#true} #res := ~returnVal2~0; {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,486 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {63597#true} {63598#false} #1192#return; {63598#false} is VALID [2022-04-15 11:34:22,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {63597#true} call ULTIMATE.init(); {63666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:22,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {63666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63597#true} {63597#true} #1270#return; {63597#true} is VALID [2022-04-15 11:34:22,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {63597#true} call #t~ret213 := main(); {63597#true} is VALID [2022-04-15 11:34:22,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {63597#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {63597#true} is VALID [2022-04-15 11:34:22,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {63597#true} call _BLAST_init(); {63667#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:22,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {63667#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,489 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {63597#true} {63597#true} #1216#return; {63597#true} is VALID [2022-04-15 11:34:22,490 INFO L272 TraceCheckUtils]: 10: Hoare triple {63597#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:22,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {63597#true} is VALID [2022-04-15 11:34:22,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {63597#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {63597#true} is VALID [2022-04-15 11:34:22,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {63597#true} ~cond := #in~cond; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {63597#true} assume !(0 == ~cond); {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63597#true} {63597#true} #1254#return; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {63597#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {63597#true} {63597#true} #1218#return; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {63597#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {63597#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {63597#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {63597#true} is VALID [2022-04-15 11:34:22,492 INFO L272 TraceCheckUtils]: 23: Hoare triple {63597#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:22,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L272 TraceCheckUtils]: 25: Hoare triple {63597#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {63673#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~5; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {63597#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {63597#true} {63597#true} #1176#return; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {63597#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {63597#true} is VALID [2022-04-15 11:34:22,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {63597#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {63597#true} is VALID [2022-04-15 11:34:22,495 INFO L272 TraceCheckUtils]: 33: Hoare triple {63597#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:22,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:34:22,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {63689#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:34:22,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {63690#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:34:22,499 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {63691#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {63597#true} #1178#return; {63598#false} is VALID [2022-04-15 11:34:22,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {63598#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {63598#false} is VALID [2022-04-15 11:34:22,500 INFO L272 TraceCheckUtils]: 40: Hoare triple {63598#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {63597#true} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {63597#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {63597#true} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~2; {63597#true} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {63597#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {63597#true} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,500 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {63597#true} {63598#false} #1180#return; {63598#false} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {63598#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {63598#false} is VALID [2022-04-15 11:34:22,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {63598#false} assume true; {63598#false} is VALID [2022-04-15 11:34:22,500 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {63598#false} {63597#true} #1220#return; {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {63598#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L272 TraceCheckUtils]: 50: Hoare triple {63598#false} call stub_driver_init(); {63692#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {63692#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,501 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {63597#true} {63598#false} #1222#return; {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {63598#false} assume !!(~status~5 >= 0); {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {63598#false} assume !(0 == ~__BLAST_NONDET~0); {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {63598#false} assume !(1 == ~__BLAST_NONDET~0); {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {63598#false} assume !(2 == ~__BLAST_NONDET~0); {63598#false} is VALID [2022-04-15 11:34:22,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {63598#false} assume 3 == ~__BLAST_NONDET~0; {63598#false} is VALID [2022-04-15 11:34:22,502 INFO L272 TraceCheckUtils]: 59: Hoare triple {63598#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {63598#false} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {63598#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {63598#false} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {63598#false} assume 0 == #t~mem81 % 256;havoc #t~mem81; {63598#false} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {63598#false} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {63598#false} is VALID [2022-04-15 11:34:22,502 INFO L272 TraceCheckUtils]: 63: Hoare triple {63598#false} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {63668#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {63597#true} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {63597#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {63597#true} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {63597#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {63597#true} is VALID [2022-04-15 11:34:22,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {63597#true} assume #res.base == dest.base && #res.offset == dest.offset; {63597#true} is VALID [2022-04-15 11:34:22,502 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {63597#true} {63598#false} #1186#return; {63598#false} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {63598#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {63598#false} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {63598#false} assume !(~s~0 != ~NP~0); {63598#false} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {63598#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {63598#false} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {63598#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {63598#false} is VALID [2022-04-15 11:34:22,503 INFO L272 TraceCheckUtils]: 73: Hoare triple {63598#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {63693#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {63693#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {63597#true} is VALID [2022-04-15 11:34:22,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {63597#true} assume 0 != ~compRegistered~0; {63597#true} is VALID [2022-04-15 11:34:22,504 INFO L272 TraceCheckUtils]: 76: Hoare triple {63597#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:22,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {63597#true} is VALID [2022-04-15 11:34:22,505 INFO L272 TraceCheckUtils]: 78: Hoare triple {63597#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:22,505 INFO L290 TraceCheckUtils]: 79: Hoare triple {63702#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {63597#true} is VALID [2022-04-15 11:34:22,505 INFO L290 TraceCheckUtils]: 80: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,505 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {63597#true} {63597#true} #1174#return; {63597#true} is VALID [2022-04-15 11:34:22,505 INFO L290 TraceCheckUtils]: 82: Hoare triple {63597#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {63597#true} is VALID [2022-04-15 11:34:22,505 INFO L290 TraceCheckUtils]: 83: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {63597#true} {63597#true} #1210#return; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 85: Hoare triple {63597#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {63597#true} assume !(-1073741802 == ~compRetStatus~0); {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 87: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~11; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 88: Hoare triple {63597#true} ~returnVal2~0 := 0; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 89: Hoare triple {63597#true} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 90: Hoare triple {63597#true} #res := ~returnVal2~0; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 91: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:22,506 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {63597#true} {63598#false} #1192#return; {63598#false} is VALID [2022-04-15 11:34:22,506 INFO L290 TraceCheckUtils]: 93: Hoare triple {63598#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {63598#false} assume !(259 == ~status~3); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 95: Hoare triple {63598#false} assume ~status~3 >= 0; {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 96: Hoare triple {63598#false} assume !(~myStatus~0 >= 0); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 97: Hoare triple {63598#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L272 TraceCheckUtils]: 98: Hoare triple {63598#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 99: Hoare triple {63598#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 100: Hoare triple {63598#false} assume !(~s~0 == ~NP~0); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L272 TraceCheckUtils]: 101: Hoare triple {63598#false} call errorFn(); {63598#false} is VALID [2022-04-15 11:34:22,507 INFO L290 TraceCheckUtils]: 102: Hoare triple {63598#false} assume !false; {63598#false} is VALID [2022-04-15 11:34:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:34:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:22,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405749660] [2022-04-15 11:34:22,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405749660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:34:22,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834375500] [2022-04-15 11:34:22,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:34:22,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:34:22,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:34:22,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:34:22,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 11:34:23,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:34:23,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:34:23,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 11:34:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:23,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:34:23,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {63597#true} call ULTIMATE.init(); {63597#true} is VALID [2022-04-15 11:34:23,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {63597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {63597#true} is VALID [2022-04-15 11:34:23,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63597#true} {63597#true} #1270#return; {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {63597#true} call #t~ret213 := main(); {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {63597#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {63597#true} call _BLAST_init(); {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {63597#true} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {63597#true} {63597#true} #1216#return; {63597#true} is VALID [2022-04-15 11:34:23,718 INFO L272 TraceCheckUtils]: 10: Hoare triple {63597#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {63597#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {63597#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {63597#true} ~cond := #in~cond; {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {63597#true} assume !(0 == ~cond); {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {63597#true} {63597#true} #1254#return; {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {63597#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:23,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {63597#true} {63597#true} #1218#return; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {63597#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {63597#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {63597#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L272 TraceCheckUtils]: 23: Hoare triple {63597#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {63597#true} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L272 TraceCheckUtils]: 25: Hoare triple {63597#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {63597#true} is VALID [2022-04-15 11:34:23,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {63597#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~5; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {63597#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {63597#true} {63597#true} #1176#return; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {63597#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {63597#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L272 TraceCheckUtils]: 33: Hoare triple {63597#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {63597#true} is VALID [2022-04-15 11:34:23,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {63597#true} #t~loopctr214 := 0; {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {63597#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {63597#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {63597#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {63597#true} {63597#true} #1178#return; {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {63597#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L272 TraceCheckUtils]: 40: Hoare triple {63597#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {63597#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {63597#true} is VALID [2022-04-15 11:34:23,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {63597#true} assume 0 == ~__BLAST_NONDET~2; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {63597#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {63597#true} {63597#true} #1180#return; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {63597#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {63597#true} {63597#true} #1220#return; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {63597#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {63597#true} is VALID [2022-04-15 11:34:23,723 INFO L272 TraceCheckUtils]: 50: Hoare triple {63597#true} call stub_driver_init(); {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {63597#true} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {63597#true} {63597#true} #1222#return; {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {63597#true} assume !!(~status~5 >= 0); {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {63597#true} assume !(0 == ~__BLAST_NONDET~0); {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {63597#true} assume !(1 == ~__BLAST_NONDET~0); {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {63597#true} assume !(2 == ~__BLAST_NONDET~0); {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {63597#true} assume 3 == ~__BLAST_NONDET~0; {63597#true} is VALID [2022-04-15 11:34:23,724 INFO L272 TraceCheckUtils]: 59: Hoare triple {63597#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {63597#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {63597#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {63597#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L272 TraceCheckUtils]: 63: Hoare triple {63597#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {63597#true} #t~loopctr215 := 0; {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {63597#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {63597#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {63597#true} is VALID [2022-04-15 11:34:23,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {63597#true} assume #res.base == dest.base && #res.offset == dest.offset; {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {63597#true} {63597#true} #1186#return; {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {63597#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {63597#true} assume !(~s~0 != ~NP~0); {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {63597#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {63597#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L272 TraceCheckUtils]: 73: Hoare triple {63597#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {63597#true} is VALID [2022-04-15 11:34:23,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {63597#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {63597#true} assume 0 != ~compRegistered~0; {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L272 TraceCheckUtils]: 76: Hoare triple {63597#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {63597#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L272 TraceCheckUtils]: 78: Hoare triple {63597#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {63597#true} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {63597#true} assume true; {63597#true} is VALID [2022-04-15 11:34:23,727 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {63597#true} {63597#true} #1174#return; {63597#true} is VALID [2022-04-15 11:34:23,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {63597#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {63955#(= (- 1073741802) |KbFilter_Complete_#res|)} is VALID [2022-04-15 11:34:23,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {63955#(= (- 1073741802) |KbFilter_Complete_#res|)} assume true; {63955#(= (- 1073741802) |KbFilter_Complete_#res|)} is VALID [2022-04-15 11:34:23,730 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {63955#(= (- 1073741802) |KbFilter_Complete_#res|)} {63597#true} #1210#return; {63962#(= |IofCallDriver_#t~ret196| (- 1073741802))} is VALID [2022-04-15 11:34:23,730 INFO L290 TraceCheckUtils]: 85: Hoare triple {63962#(= |IofCallDriver_#t~ret196| (- 1073741802))} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {63966#(= (- 1073741802) IofCallDriver_~compRetStatus~0)} is VALID [2022-04-15 11:34:23,730 INFO L290 TraceCheckUtils]: 86: Hoare triple {63966#(= (- 1073741802) IofCallDriver_~compRetStatus~0)} assume !(-1073741802 == ~compRetStatus~0); {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 87: Hoare triple {63598#false} assume 0 == ~__BLAST_NONDET~11; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 88: Hoare triple {63598#false} ~returnVal2~0 := 0; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 89: Hoare triple {63598#false} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 90: Hoare triple {63598#false} #res := ~returnVal2~0; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 91: Hoare triple {63598#false} assume true; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {63598#false} {63597#true} #1192#return; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 93: Hoare triple {63598#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {63598#false} is VALID [2022-04-15 11:34:23,731 INFO L290 TraceCheckUtils]: 94: Hoare triple {63598#false} assume !(259 == ~status~3); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 95: Hoare triple {63598#false} assume ~status~3 >= 0; {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 96: Hoare triple {63598#false} assume !(~myStatus~0 >= 0); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 97: Hoare triple {63598#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L272 TraceCheckUtils]: 98: Hoare triple {63598#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 99: Hoare triple {63598#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 100: Hoare triple {63598#false} assume !(~s~0 == ~NP~0); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L272 TraceCheckUtils]: 101: Hoare triple {63598#false} call errorFn(); {63598#false} is VALID [2022-04-15 11:34:23,732 INFO L290 TraceCheckUtils]: 102: Hoare triple {63598#false} assume !false; {63598#false} is VALID [2022-04-15 11:34:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:34:23,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:34:23,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834375500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:23,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:34:23,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-04-15 11:34:23,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813606899] [2022-04-15 11:34:23,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813606899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:23,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:23,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669228348] [2022-04-15 11:34:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:23,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2022-04-15 11:34:23,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:23,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-04-15 11:34:23,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:23,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:23,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:23,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:34:23,829 INFO L87 Difference]: Start difference. First operand 339 states and 401 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-04-15 11:34:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:35,190 INFO L93 Difference]: Finished difference Result 435 states and 520 transitions. [2022-04-15 11:34:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2022-04-15 11:34:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-04-15 11:34:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2022-04-15 11:34:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-04-15 11:34:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2022-04-15 11:34:35,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 227 transitions. [2022-04-15 11:34:35,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:35,366 INFO L225 Difference]: With dead ends: 435 [2022-04-15 11:34:35,366 INFO L226 Difference]: Without dead ends: 325 [2022-04-15 11:34:35,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:34:35,366 INFO L913 BasicCegarLoop]: 162 mSDtfsCounter, 15 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:35,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 628 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:34:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-15 11:34:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-04-15 11:34:36,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:36,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:36,014 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:36,014 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:36,018 INFO L93 Difference]: Finished difference Result 325 states and 381 transitions. [2022-04-15 11:34:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 381 transitions. [2022-04-15 11:34:36,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:36,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:36,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 325 states. [2022-04-15 11:34:36,019 INFO L87 Difference]: Start difference. First operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 325 states. [2022-04-15 11:34:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:36,025 INFO L93 Difference]: Finished difference Result 325 states and 381 transitions. [2022-04-15 11:34:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 381 transitions. [2022-04-15 11:34:36,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:36,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:36,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:36,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 250 states have (on average 1.22) internal successors, (305), 254 states have internal predecessors, (305), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:34:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 381 transitions. [2022-04-15 11:34:36,033 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 381 transitions. Word has length 103 [2022-04-15 11:34:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:36,033 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 381 transitions. [2022-04-15 11:34:36,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2022-04-15 11:34:36,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 381 transitions. [2022-04-15 11:34:36,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 381 transitions. [2022-04-15 11:34:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 11:34:36,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:36,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:36,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 11:34:37,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 11:34:37,128 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 813900694, now seen corresponding path program 1 times [2022-04-15 11:34:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:37,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835956966] [2022-04-15 11:34:37,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:34:37,132 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:34:37,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 813900694, now seen corresponding path program 2 times [2022-04-15 11:34:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110250971] [2022-04-15 11:34:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {66261#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66187#true} {66187#true} #1270#return; {66187#true} is VALID [2022-04-15 11:34:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:34:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {66262#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {66187#true} #1216#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:34:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {66187#true} ~cond := #in~cond; {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume !(0 == ~cond); {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66187#true} {66187#true} #1254#return; {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L272 TraceCheckUtils]: 1: Hoare triple {66187#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {66187#true} is VALID [2022-04-15 11:34:37,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} ~cond := #in~cond; {66187#true} is VALID [2022-04-15 11:34:37,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume !(0 == ~cond); {66187#true} is VALID [2022-04-15 11:34:37,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,439 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66187#true} {66187#true} #1254#return; {66187#true} is VALID [2022-04-15 11:34:37,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {66187#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {66187#true} is VALID [2022-04-15 11:34:37,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,440 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1218#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:34:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {66187#true} is VALID [2022-04-15 11:34:37,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~5; {66187#true} is VALID [2022-04-15 11:34:37,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {66187#true} is VALID [2022-04-15 11:34:37,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,496 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66187#true} {66187#true} #1176#return; {66187#true} is VALID [2022-04-15 11:34:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:34:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {66187#true} is VALID [2022-04-15 11:34:37,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {66187#true} is VALID [2022-04-15 11:34:37,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {66187#true} is VALID [2022-04-15 11:34:37,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66187#true} is VALID [2022-04-15 11:34:37,506 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66187#true} {66187#true} #1178#return; {66187#true} is VALID [2022-04-15 11:34:37,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:34:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {66187#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {66187#true} is VALID [2022-04-15 11:34:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~2; {66187#true} is VALID [2022-04-15 11:34:37,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {66187#true} is VALID [2022-04-15 11:34:37,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,514 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66187#true} {66187#true} #1180#return; {66187#true} is VALID [2022-04-15 11:34:37,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,515 INFO L272 TraceCheckUtils]: 1: Hoare triple {66187#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~5; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {66187#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66187#true} {66187#true} #1176#return; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {66187#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {66187#true} is VALID [2022-04-15 11:34:37,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {66187#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {66187#true} is VALID [2022-04-15 11:34:37,517 INFO L272 TraceCheckUtils]: 9: Hoare triple {66187#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:37,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {66187#true} is VALID [2022-04-15 11:34:37,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {66187#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {66187#true} is VALID [2022-04-15 11:34:37,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {66187#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {66187#true} is VALID [2022-04-15 11:34:37,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {66187#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {66187#true} {66187#true} #1178#return; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {66187#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L272 TraceCheckUtils]: 16: Hoare triple {66187#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {66187#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~2; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {66187#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66187#true} {66187#true} #1180#return; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {66187#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {66187#true} is VALID [2022-04-15 11:34:37,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,519 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1220#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:34:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {66284#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1222#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:34:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {66187#true} is VALID [2022-04-15 11:34:37,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {66187#true} is VALID [2022-04-15 11:34:37,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {66187#true} is VALID [2022-04-15 11:34:37,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume #res.base == dest.base && #res.offset == dest.offset; {66187#true} is VALID [2022-04-15 11:34:37,556 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1186#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:34:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:34:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {66187#true} is VALID [2022-04-15 11:34:37,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66187#true} {66187#true} #1174#return; {66187#true} is VALID [2022-04-15 11:34:37,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L272 TraceCheckUtils]: 1: Hoare triple {66187#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:37,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66187#true} {66187#true} #1174#return; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {66187#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,646 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66187#true} {66187#true} #1210#return; {66187#true} is VALID [2022-04-15 11:34:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:34:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:37,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {66303#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {66304#(= ~MPR1~0 ~s~0)} assume true; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66304#(= ~MPR1~0 ~s~0)} {66187#true} #1212#return; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {66285#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {66187#true} is VALID [2022-04-15 11:34:37,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {66187#true} assume 0 != ~compRegistered~0; {66187#true} is VALID [2022-04-15 11:34:37,677 INFO L272 TraceCheckUtils]: 2: Hoare triple {66187#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:37,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {66187#true} is VALID [2022-04-15 11:34:37,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {66187#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66187#true} {66187#true} #1174#return; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {66187#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66187#true} {66187#true} #1210#return; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {66187#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {66187#true} is VALID [2022-04-15 11:34:37,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {66187#true} assume -1073741802 == ~compRetStatus~0; {66187#true} is VALID [2022-04-15 11:34:37,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {66187#true} call stubMoreProcessingRequired(); {66303#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:37,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {66303#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {66304#(= ~MPR1~0 ~s~0)} assume true; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,680 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66304#(= ~MPR1~0 ~s~0)} {66187#true} #1212#return; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~__BLAST_NONDET~11; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,683 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1192#return; {66188#false} is VALID [2022-04-15 11:34:37,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {66187#true} call ULTIMATE.init(); {66261#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:37,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {66261#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66187#true} {66187#true} #1270#return; {66187#true} is VALID [2022-04-15 11:34:37,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {66187#true} call #t~ret213 := main(); {66187#true} is VALID [2022-04-15 11:34:37,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {66187#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {66187#true} is VALID [2022-04-15 11:34:37,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {66187#true} call _BLAST_init(); {66262#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:37,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {66262#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,688 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {66187#true} #1216#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,689 INFO L272 TraceCheckUtils]: 10: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:37,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {66187#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {66187#true} ~cond := #in~cond; {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {66187#true} assume !(0 == ~cond); {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66187#true} {66187#true} #1254#return; {66187#true} is VALID [2022-04-15 11:34:37,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {66187#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {66187#true} is VALID [2022-04-15 11:34:37,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,690 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1218#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,693 INFO L272 TraceCheckUtils]: 23: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:37,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,695 INFO L272 TraceCheckUtils]: 25: Hoare triple {66187#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:37,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {66268#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {66187#true} is VALID [2022-04-15 11:34:37,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~5; {66187#true} is VALID [2022-04-15 11:34:37,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {66187#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {66187#true} is VALID [2022-04-15 11:34:37,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,695 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {66187#true} {66187#true} #1176#return; {66187#true} is VALID [2022-04-15 11:34:37,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {66187#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {66187#true} is VALID [2022-04-15 11:34:37,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {66187#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {66187#true} is VALID [2022-04-15 11:34:37,696 INFO L272 TraceCheckUtils]: 33: Hoare triple {66187#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {66187#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {66187#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {66187#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {66187#true} {66187#true} #1178#return; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {66187#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L272 TraceCheckUtils]: 40: Hoare triple {66187#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {66187#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {66187#true} assume 0 == ~__BLAST_NONDET~2; {66187#true} is VALID [2022-04-15 11:34:37,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {66187#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {66187#true} is VALID [2022-04-15 11:34:37,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,698 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {66187#true} {66187#true} #1180#return; {66187#true} is VALID [2022-04-15 11:34:37,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {66187#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {66187#true} is VALID [2022-04-15 11:34:37,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,699 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1220#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,700 INFO L272 TraceCheckUtils]: 50: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call stub_driver_init(); {66284#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:37,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {66284#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {66187#true} is VALID [2022-04-15 11:34:37,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,701 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1222#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !!(~status~5 >= 0); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~__BLAST_NONDET~0); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(1 == ~__BLAST_NONDET~0); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(2 == ~__BLAST_NONDET~0); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 3 == ~__BLAST_NONDET~0; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,704 INFO L272 TraceCheckUtils]: 59: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == #t~mem81 % 256;havoc #t~mem81; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,706 INFO L272 TraceCheckUtils]: 63: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:37,707 INFO L290 TraceCheckUtils]: 64: Hoare triple {66263#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {66187#true} is VALID [2022-04-15 11:34:37,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {66187#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {66187#true} is VALID [2022-04-15 11:34:37,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {66187#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {66187#true} is VALID [2022-04-15 11:34:37,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {66187#true} assume #res.base == dest.base && #res.offset == dest.offset; {66187#true} is VALID [2022-04-15 11:34:37,708 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66187#true} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1186#return; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~s~0 != ~NP~0); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 11:34:37,711 INFO L272 TraceCheckUtils]: 73: Hoare triple {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {66285#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:37,712 INFO L290 TraceCheckUtils]: 74: Hoare triple {66285#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {66187#true} is VALID [2022-04-15 11:34:37,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {66187#true} assume 0 != ~compRegistered~0; {66187#true} is VALID [2022-04-15 11:34:37,713 INFO L272 TraceCheckUtils]: 76: Hoare triple {66187#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:37,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L272 TraceCheckUtils]: 78: Hoare triple {66187#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {66299#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {66187#true} {66187#true} #1174#return; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 82: Hoare triple {66187#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {66187#true} assume true; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {66187#true} {66187#true} #1210#return; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {66187#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {66187#true} is VALID [2022-04-15 11:34:37,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {66187#true} assume -1073741802 == ~compRetStatus~0; {66187#true} is VALID [2022-04-15 11:34:37,715 INFO L272 TraceCheckUtils]: 87: Hoare triple {66187#true} call stubMoreProcessingRequired(); {66303#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:37,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {66303#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {66304#(= ~MPR1~0 ~s~0)} assume true; {66304#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 11:34:37,716 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {66304#(= ~MPR1~0 ~s~0)} {66187#true} #1212#return; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~__BLAST_NONDET~11; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,717 INFO L290 TraceCheckUtils]: 92: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 11:34:37,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {66297#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,717 INFO L290 TraceCheckUtils]: 94: Hoare triple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,718 INFO L290 TraceCheckUtils]: 95: Hoare triple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 11:34:37,719 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66298#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {66195#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #1192#return; {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L290 TraceCheckUtils]: 97: Hoare triple {66188#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L290 TraceCheckUtils]: 98: Hoare triple {66188#false} assume !(259 == ~status~3); {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {66188#false} assume ~status~3 >= 0; {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {66188#false} assume !(~myStatus~0 >= 0); {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {66188#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {66188#false} is VALID [2022-04-15 11:34:37,719 INFO L272 TraceCheckUtils]: 102: Hoare triple {66188#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {66188#false} is VALID [2022-04-15 11:34:37,720 INFO L290 TraceCheckUtils]: 103: Hoare triple {66188#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {66188#false} is VALID [2022-04-15 11:34:37,720 INFO L290 TraceCheckUtils]: 104: Hoare triple {66188#false} assume !(~s~0 == ~NP~0); {66188#false} is VALID [2022-04-15 11:34:37,720 INFO L272 TraceCheckUtils]: 105: Hoare triple {66188#false} call errorFn(); {66188#false} is VALID [2022-04-15 11:34:37,720 INFO L290 TraceCheckUtils]: 106: Hoare triple {66188#false} assume !false; {66188#false} is VALID [2022-04-15 11:34:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:34:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110250971] [2022-04-15 11:34:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110250971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:34:37,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835956966] [2022-04-15 11:34:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835956966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:34:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347430458] [2022-04-15 11:34:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2022-04-15 11:34:37,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:37,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:34:37,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:37,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:34:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:34:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:34:37,819 INFO L87 Difference]: Start difference. First operand 325 states and 381 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:34:40,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:43,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:45,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:48,157 INFO L93 Difference]: Finished difference Result 459 states and 550 transitions. [2022-04-15 11:34:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:34:48,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2022-04-15 11:34:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:34:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2022-04-15 11:34:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:34:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2022-04-15 11:34:48,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 244 transitions. [2022-04-15 11:34:48,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:48,439 INFO L225 Difference]: With dead ends: 459 [2022-04-15 11:34:48,439 INFO L226 Difference]: Without dead ends: 363 [2022-04-15 11:34:48,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:34:48,440 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 436 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 228 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:48,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 323 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:34:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-15 11:34:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 313. [2022-04-15 11:34:49,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:49,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:49,076 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:49,076 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:49,081 INFO L93 Difference]: Finished difference Result 363 states and 427 transitions. [2022-04-15 11:34:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 427 transitions. [2022-04-15 11:34:49,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:49,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:49,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 363 states. [2022-04-15 11:34:49,082 INFO L87 Difference]: Start difference. First operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 363 states. [2022-04-15 11:34:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:49,087 INFO L93 Difference]: Finished difference Result 363 states and 427 transitions. [2022-04-15 11:34:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 427 transitions. [2022-04-15 11:34:49,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:49,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:49,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:49,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 240 states have (on average 1.2125) internal successors, (291), 244 states have internal predecessors, (291), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 365 transitions. [2022-04-15 11:34:49,093 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 365 transitions. Word has length 107 [2022-04-15 11:34:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:49,093 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 365 transitions. [2022-04-15 11:34:49,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (18), 11 states have call predecessors, (18), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:34:49,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 365 transitions. [2022-04-15 11:34:49,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 365 transitions. [2022-04-15 11:34:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:34:49,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:49,953 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:49,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:34:49,953 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1477106018, now seen corresponding path program 1 times [2022-04-15 11:34:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:49,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266728011] [2022-04-15 11:34:49,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:34:49,956 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:34:49,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1477106018, now seen corresponding path program 2 times [2022-04-15 11:34:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403823831] [2022-04-15 11:34:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {68684#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68607#true} {68607#true} #1270#return; {68607#true} is VALID [2022-04-15 11:34:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:34:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {68685#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68607#true} {68607#true} #1216#return; {68607#true} is VALID [2022-04-15 11:34:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:34:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {68607#true} ~cond := #in~cond; {68607#true} is VALID [2022-04-15 11:34:50,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume !(0 == ~cond); {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68607#true} {68607#true} #1254#return; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L272 TraceCheckUtils]: 1: Hoare triple {68607#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} ~cond := #in~cond; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume !(0 == ~cond); {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {68607#true} {68607#true} #1254#return; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {68607#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {68607#true} is VALID [2022-04-15 11:34:50,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,235 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {68607#true} {68607#true} #1218#return; {68607#true} is VALID [2022-04-15 11:34:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:34:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {68607#true} is VALID [2022-04-15 11:34:50,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~5; {68607#true} is VALID [2022-04-15 11:34:50,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {68607#true} is VALID [2022-04-15 11:34:50,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,290 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68607#true} {68607#true} #1176#return; {68607#true} is VALID [2022-04-15 11:34:50,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:34:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {68607#true} is VALID [2022-04-15 11:34:50,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {68607#true} is VALID [2022-04-15 11:34:50,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {68607#true} is VALID [2022-04-15 11:34:50,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {68607#true} is VALID [2022-04-15 11:34:50,299 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68607#true} {68607#true} #1178#return; {68607#true} is VALID [2022-04-15 11:34:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:34:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {68607#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {68607#true} is VALID [2022-04-15 11:34:50,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~2; {68607#true} is VALID [2022-04-15 11:34:50,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {68607#true} is VALID [2022-04-15 11:34:50,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,307 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68607#true} {68607#true} #1180#return; {68607#true} is VALID [2022-04-15 11:34:50,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,309 INFO L272 TraceCheckUtils]: 1: Hoare triple {68607#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:50,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {68607#true} is VALID [2022-04-15 11:34:50,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~5; {68607#true} is VALID [2022-04-15 11:34:50,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {68607#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {68607#true} is VALID [2022-04-15 11:34:50,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {68607#true} {68607#true} #1176#return; {68607#true} is VALID [2022-04-15 11:34:50,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {68607#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {68607#true} is VALID [2022-04-15 11:34:50,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {68607#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {68607#true} is VALID [2022-04-15 11:34:50,310 INFO L272 TraceCheckUtils]: 9: Hoare triple {68607#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:50,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {68607#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {68607#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {68607#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {68607#true} {68607#true} #1178#return; {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {68607#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {68607#true} is VALID [2022-04-15 11:34:50,311 INFO L272 TraceCheckUtils]: 16: Hoare triple {68607#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {68607#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~2; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {68607#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {68607#true} {68607#true} #1180#return; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {68607#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,312 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {68607#true} {68607#true} #1220#return; {68607#true} is VALID [2022-04-15 11:34:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:34:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {68707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68607#true} {68607#true} #1222#return; {68607#true} is VALID [2022-04-15 11:34:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:34:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {68607#true} is VALID [2022-04-15 11:34:50,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {68607#true} is VALID [2022-04-15 11:34:50,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {68607#true} is VALID [2022-04-15 11:34:50,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume #res.base == dest.base && #res.offset == dest.offset; {68607#true} is VALID [2022-04-15 11:34:50,344 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68607#true} {68607#true} #1186#return; {68607#true} is VALID [2022-04-15 11:34:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:34:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:34:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {68607#true} is VALID [2022-04-15 11:34:50,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68607#true} {68607#true} #1174#return; {68607#true} is VALID [2022-04-15 11:34:50,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {68607#true} is VALID [2022-04-15 11:34:50,390 INFO L272 TraceCheckUtils]: 1: Hoare triple {68607#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:50,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {68607#true} is VALID [2022-04-15 11:34:50,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,390 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {68607#true} {68607#true} #1174#return; {68607#true} is VALID [2022-04-15 11:34:50,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {68607#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {68607#true} is VALID [2022-04-15 11:34:50,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,391 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {68607#true} {68607#true} #1210#return; {68607#true} is VALID [2022-04-15 11:34:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:34:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {68724#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {68607#true} is VALID [2022-04-15 11:34:50,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68607#true} {68607#true} #1212#return; {68607#true} is VALID [2022-04-15 11:34:50,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {68708#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {68607#true} is VALID [2022-04-15 11:34:50,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {68607#true} assume 0 != ~compRegistered~0; {68607#true} is VALID [2022-04-15 11:34:50,407 INFO L272 TraceCheckUtils]: 2: Hoare triple {68607#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:50,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {68607#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:50,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {68607#true} {68607#true} #1174#return; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {68607#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68607#true} {68607#true} #1210#return; {68607#true} is VALID [2022-04-15 11:34:50,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {68607#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {68607#true} assume -1073741802 == ~compRetStatus~0; {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L272 TraceCheckUtils]: 13: Hoare triple {68607#true} call stubMoreProcessingRequired(); {68724#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:50,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {68724#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {68607#true} {68607#true} #1212#return; {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {68607#true} assume !(0 == ~__BLAST_NONDET~11); {68607#true} is VALID [2022-04-15 11:34:50,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {68607#true} assume 1 == ~__BLAST_NONDET~11; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {68607#true} ~returnVal2~0 := -1073741823; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {68607#true} assume !(~s~0 == ~NP~0); {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {68607#true} assume ~s~0 == ~MPR1~0; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {68607#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {68607#true} #res := ~returnVal2~0; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,410 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {68607#true} {68607#true} #1192#return; {68607#true} is VALID [2022-04-15 11:34:50,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {68607#true} call ULTIMATE.init(); {68684#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:50,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {68684#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68607#true} {68607#true} #1270#return; {68607#true} is VALID [2022-04-15 11:34:50,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {68607#true} call #t~ret213 := main(); {68607#true} is VALID [2022-04-15 11:34:50,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {68607#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {68607#true} is VALID [2022-04-15 11:34:50,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {68607#true} call _BLAST_init(); {68685#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:50,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {68685#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,414 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {68607#true} {68607#true} #1216#return; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L272 TraceCheckUtils]: 10: Hoare triple {68607#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L272 TraceCheckUtils]: 12: Hoare triple {68607#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {68607#true} ~cond := #in~cond; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {68607#true} assume !(0 == ~cond); {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {68607#true} {68607#true} #1254#return; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {68607#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,415 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {68607#true} {68607#true} #1218#return; {68607#true} is VALID [2022-04-15 11:34:50,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {68607#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {68607#true} is VALID [2022-04-15 11:34:50,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {68607#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {68607#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {68607#true} is VALID [2022-04-15 11:34:50,417 INFO L272 TraceCheckUtils]: 23: Hoare triple {68607#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:50,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,418 INFO L272 TraceCheckUtils]: 25: Hoare triple {68607#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:50,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {68691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {68607#true} is VALID [2022-04-15 11:34:50,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~5; {68607#true} is VALID [2022-04-15 11:34:50,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {68607#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {68607#true} is VALID [2022-04-15 11:34:50,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,419 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {68607#true} {68607#true} #1176#return; {68607#true} is VALID [2022-04-15 11:34:50,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {68607#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {68607#true} is VALID [2022-04-15 11:34:50,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {68607#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L272 TraceCheckUtils]: 33: Hoare triple {68607#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:50,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {68607#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {68607#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {68607#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {68607#true} {68607#true} #1178#return; {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {68607#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {68607#true} is VALID [2022-04-15 11:34:50,420 INFO L272 TraceCheckUtils]: 40: Hoare triple {68607#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {68607#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {68607#true} assume 0 == ~__BLAST_NONDET~2; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {68607#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {68607#true} {68607#true} #1180#return; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {68607#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {68607#true} {68607#true} #1220#return; {68607#true} is VALID [2022-04-15 11:34:50,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {68607#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {68607#true} is VALID [2022-04-15 11:34:50,422 INFO L272 TraceCheckUtils]: 50: Hoare triple {68607#true} call stub_driver_init(); {68707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:50,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {68707#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {68607#true} is VALID [2022-04-15 11:34:50,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,422 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {68607#true} {68607#true} #1222#return; {68607#true} is VALID [2022-04-15 11:34:50,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {68607#true} assume !!(~status~5 >= 0); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {68607#true} assume !(0 == ~__BLAST_NONDET~0); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {68607#true} assume !(1 == ~__BLAST_NONDET~0); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {68607#true} assume !(2 == ~__BLAST_NONDET~0); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {68607#true} assume 3 == ~__BLAST_NONDET~0; {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L272 TraceCheckUtils]: 59: Hoare triple {68607#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {68607#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {68607#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {68607#true} is VALID [2022-04-15 11:34:50,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {68607#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {68607#true} is VALID [2022-04-15 11:34:50,424 INFO L272 TraceCheckUtils]: 63: Hoare triple {68607#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:50,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {68686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {68607#true} is VALID [2022-04-15 11:34:50,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {68607#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {68607#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {68607#true} assume #res.base == dest.base && #res.offset == dest.offset; {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {68607#true} {68607#true} #1186#return; {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {68607#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {68607#true} assume !(~s~0 != ~NP~0); {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {68607#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {68607#true} is VALID [2022-04-15 11:34:50,425 INFO L290 TraceCheckUtils]: 72: Hoare triple {68607#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {68607#true} is VALID [2022-04-15 11:34:50,426 INFO L272 TraceCheckUtils]: 73: Hoare triple {68607#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {68708#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:50,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {68708#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {68607#true} is VALID [2022-04-15 11:34:50,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {68607#true} assume 0 != ~compRegistered~0; {68607#true} is VALID [2022-04-15 11:34:50,427 INFO L272 TraceCheckUtils]: 76: Hoare triple {68607#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:50,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {68607#true} is VALID [2022-04-15 11:34:50,428 INFO L272 TraceCheckUtils]: 78: Hoare triple {68607#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:50,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {68720#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {68607#true} is VALID [2022-04-15 11:34:50,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,428 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {68607#true} {68607#true} #1174#return; {68607#true} is VALID [2022-04-15 11:34:50,428 INFO L290 TraceCheckUtils]: 82: Hoare triple {68607#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {68607#true} {68607#true} #1210#return; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {68607#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L290 TraceCheckUtils]: 86: Hoare triple {68607#true} assume -1073741802 == ~compRetStatus~0; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L272 TraceCheckUtils]: 87: Hoare triple {68607#true} call stubMoreProcessingRequired(); {68724#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:50,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {68724#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,429 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {68607#true} {68607#true} #1212#return; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 91: Hoare triple {68607#true} assume !(0 == ~__BLAST_NONDET~11); {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 92: Hoare triple {68607#true} assume 1 == ~__BLAST_NONDET~11; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {68607#true} ~returnVal2~0 := -1073741823; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {68607#true} assume !(~s~0 == ~NP~0); {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 95: Hoare triple {68607#true} assume ~s~0 == ~MPR1~0; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 96: Hoare triple {68607#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 97: Hoare triple {68607#true} #res := ~returnVal2~0; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {68607#true} assume true; {68607#true} is VALID [2022-04-15 11:34:50,430 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {68607#true} {68607#true} #1192#return; {68607#true} is VALID [2022-04-15 11:34:50,431 INFO L290 TraceCheckUtils]: 100: Hoare triple {68607#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {68607#true} is VALID [2022-04-15 11:34:50,431 INFO L290 TraceCheckUtils]: 101: Hoare triple {68607#true} assume 259 == ~status~3; {68607#true} is VALID [2022-04-15 11:34:50,431 INFO L272 TraceCheckUtils]: 102: Hoare triple {68607#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {68607#true} is VALID [2022-04-15 11:34:50,431 INFO L290 TraceCheckUtils]: 103: Hoare triple {68607#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {68607#true} is VALID [2022-04-15 11:34:50,431 INFO L290 TraceCheckUtils]: 104: Hoare triple {68607#true} assume !(~s~0 == ~MPR3~0); {68683#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:34:50,432 INFO L290 TraceCheckUtils]: 105: Hoare triple {68683#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {68683#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:34:50,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {68683#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {68608#false} is VALID [2022-04-15 11:34:50,432 INFO L272 TraceCheckUtils]: 107: Hoare triple {68608#false} call errorFn(); {68608#false} is VALID [2022-04-15 11:34:50,432 INFO L290 TraceCheckUtils]: 108: Hoare triple {68608#false} assume !false; {68608#false} is VALID [2022-04-15 11:34:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:34:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403823831] [2022-04-15 11:34:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403823831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:50,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:50,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266728011] [2022-04-15 11:34:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266728011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:50,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:50,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381862211] [2022-04-15 11:34:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:34:50,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:50,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:50,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:50,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:34:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:50,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:34:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:34:50,540 INFO L87 Difference]: Start difference. First operand 313 states and 365 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:52,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:57,357 INFO L93 Difference]: Finished difference Result 395 states and 474 transitions. [2022-04-15 11:34:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:34:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:34:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 208 transitions. [2022-04-15 11:34:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 208 transitions. [2022-04-15 11:34:57,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 208 transitions. [2022-04-15 11:34:57,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:57,621 INFO L225 Difference]: With dead ends: 395 [2022-04-15 11:34:57,621 INFO L226 Difference]: Without dead ends: 392 [2022-04-15 11:34:57,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:34:57,622 INFO L913 BasicCegarLoop]: 148 mSDtfsCounter, 287 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 157 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:57,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 330 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:34:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-04-15 11:34:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 321. [2022-04-15 11:34:58,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:58,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 392 states. Second operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:58,266 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:58,266 INFO L87 Difference]: Start difference. First operand 392 states. Second operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:58,272 INFO L93 Difference]: Finished difference Result 392 states and 468 transitions. [2022-04-15 11:34:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 468 transitions. [2022-04-15 11:34:58,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:58,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:58,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 392 states. [2022-04-15 11:34:58,273 INFO L87 Difference]: Start difference. First operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 392 states. [2022-04-15 11:34:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:58,282 INFO L93 Difference]: Finished difference Result 392 states and 468 transitions. [2022-04-15 11:34:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 468 transitions. [2022-04-15 11:34:58,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:58,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:58,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:58,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 248 states have (on average 1.221774193548387) internal successors, (303), 252 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:34:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 377 transitions. [2022-04-15 11:34:58,291 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 377 transitions. Word has length 109 [2022-04-15 11:34:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:58,291 INFO L478 AbstractCegarLoop]: Abstraction has 321 states and 377 transitions. [2022-04-15 11:34:58,291 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:58,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 377 transitions. [2022-04-15 11:34:59,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 377 transitions. [2022-04-15 11:34:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:34:59,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:59,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:59,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:34:59,229 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1629931519, now seen corresponding path program 1 times [2022-04-15 11:34:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:59,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188961637] [2022-04-15 11:34:59,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:34:59,238 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:34:59,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1629931519, now seen corresponding path program 2 times [2022-04-15 11:34:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:59,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420880298] [2022-04-15 11:34:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {71036#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70960#true} {70960#true} #1270#return; {70960#true} is VALID [2022-04-15 11:34:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:34:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {71037#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70960#true} {70960#true} #1216#return; {70960#true} is VALID [2022-04-15 11:34:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:34:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {70960#true} ~cond := #in~cond; {70960#true} is VALID [2022-04-15 11:34:59,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume !(0 == ~cond); {70960#true} is VALID [2022-04-15 11:34:59,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70960#true} {70960#true} #1254#return; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L272 TraceCheckUtils]: 1: Hoare triple {70960#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} ~cond := #in~cond; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume !(0 == ~cond); {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {70960#true} {70960#true} #1254#return; {70960#true} is VALID [2022-04-15 11:34:59,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {70960#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {70960#true} is VALID [2022-04-15 11:34:59,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,494 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {70960#true} {70960#true} #1218#return; {70960#true} is VALID [2022-04-15 11:34:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:34:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {70960#true} is VALID [2022-04-15 11:34:59,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~5; {70960#true} is VALID [2022-04-15 11:34:59,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {70960#true} is VALID [2022-04-15 11:34:59,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,541 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70960#true} {70960#true} #1176#return; {70960#true} is VALID [2022-04-15 11:34:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:34:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {70960#true} is VALID [2022-04-15 11:34:59,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {70960#true} is VALID [2022-04-15 11:34:59,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {70960#true} is VALID [2022-04-15 11:34:59,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {70960#true} is VALID [2022-04-15 11:34:59,552 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70960#true} {70960#true} #1178#return; {70960#true} is VALID [2022-04-15 11:34:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:34:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {70960#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {70960#true} is VALID [2022-04-15 11:34:59,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~2; {70960#true} is VALID [2022-04-15 11:34:59,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {70960#true} is VALID [2022-04-15 11:34:59,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,561 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70960#true} {70960#true} #1180#return; {70960#true} is VALID [2022-04-15 11:34:59,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,562 INFO L272 TraceCheckUtils]: 1: Hoare triple {70960#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:59,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {70960#true} is VALID [2022-04-15 11:34:59,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~5; {70960#true} is VALID [2022-04-15 11:34:59,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {70960#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {70960#true} is VALID [2022-04-15 11:34:59,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,563 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {70960#true} {70960#true} #1176#return; {70960#true} is VALID [2022-04-15 11:34:59,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {70960#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {70960#true} is VALID [2022-04-15 11:34:59,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {70960#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {70960#true} is VALID [2022-04-15 11:34:59,564 INFO L272 TraceCheckUtils]: 9: Hoare triple {70960#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:59,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {70960#true} is VALID [2022-04-15 11:34:59,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {70960#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {70960#true} is VALID [2022-04-15 11:34:59,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {70960#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {70960#true} is VALID [2022-04-15 11:34:59,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {70960#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {70960#true} is VALID [2022-04-15 11:34:59,564 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {70960#true} {70960#true} #1178#return; {70960#true} is VALID [2022-04-15 11:34:59,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {70960#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {70960#true} is VALID [2022-04-15 11:34:59,565 INFO L272 TraceCheckUtils]: 16: Hoare triple {70960#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {70960#true} is VALID [2022-04-15 11:34:59,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {70960#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~2; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {70960#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70960#true} {70960#true} #1180#return; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {70960#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {70960#true} is VALID [2022-04-15 11:34:59,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,567 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {70960#true} {70960#true} #1220#return; {70960#true} is VALID [2022-04-15 11:34:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:34:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {71059#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70960#true} {70960#true} #1222#return; {70960#true} is VALID [2022-04-15 11:34:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:34:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {70960#true} is VALID [2022-04-15 11:34:59,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {70960#true} is VALID [2022-04-15 11:34:59,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {70960#true} is VALID [2022-04-15 11:34:59,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume #res.base == dest.base && #res.offset == dest.offset; {70960#true} is VALID [2022-04-15 11:34:59,597 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70960#true} {70960#true} #1186#return; {70960#true} is VALID [2022-04-15 11:34:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:34:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:34:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:34:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {70960#true} is VALID [2022-04-15 11:34:59,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70960#true} {70960#true} #1174#return; {70960#true} is VALID [2022-04-15 11:34:59,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L272 TraceCheckUtils]: 1: Hoare triple {70960#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:59,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70960#true} {70960#true} #1174#return; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {70960#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,658 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70960#true} {70960#true} #1210#return; {70960#true} is VALID [2022-04-15 11:34:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:34:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:59,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {71077#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {70960#true} is VALID [2022-04-15 11:34:59,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70960#true} {70960#true} #1212#return; {70960#true} is VALID [2022-04-15 11:34:59,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {71060#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {70960#true} is VALID [2022-04-15 11:34:59,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {70960#true} assume 0 != ~compRegistered~0; {70960#true} is VALID [2022-04-15 11:34:59,675 INFO L272 TraceCheckUtils]: 2: Hoare triple {70960#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:59,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {70960#true} is VALID [2022-04-15 11:34:59,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {70960#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70960#true} {70960#true} #1174#return; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {70960#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70960#true} {70960#true} #1210#return; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {70960#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {70960#true} is VALID [2022-04-15 11:34:59,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {70960#true} assume -1073741802 == ~compRetStatus~0; {70960#true} is VALID [2022-04-15 11:34:59,677 INFO L272 TraceCheckUtils]: 13: Hoare triple {70960#true} call stubMoreProcessingRequired(); {71077#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:59,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {71077#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {70960#true} is VALID [2022-04-15 11:34:59,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70960#true} {70960#true} #1212#return; {70960#true} is VALID [2022-04-15 11:34:59,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {70960#true} assume !(0 == ~__BLAST_NONDET~11); {70960#true} is VALID [2022-04-15 11:34:59,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {70960#true} assume 1 == ~__BLAST_NONDET~11; {70960#true} is VALID [2022-04-15 11:34:59,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {70960#true} ~returnVal2~0 := -1073741823; {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {70961#false} is VALID [2022-04-15 11:34:59,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {70961#false} #res := ~returnVal2~0; {70961#false} is VALID [2022-04-15 11:34:59,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {70961#false} assume true; {70961#false} is VALID [2022-04-15 11:34:59,679 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {70961#false} {70960#true} #1192#return; {70961#false} is VALID [2022-04-15 11:34:59,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {70960#true} call ULTIMATE.init(); {71036#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:59,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {71036#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70960#true} {70960#true} #1270#return; {70960#true} is VALID [2022-04-15 11:34:59,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {70960#true} call #t~ret213 := main(); {70960#true} is VALID [2022-04-15 11:34:59,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {70960#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {70960#true} is VALID [2022-04-15 11:34:59,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {70960#true} call _BLAST_init(); {71037#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:59,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {71037#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,682 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {70960#true} {70960#true} #1216#return; {70960#true} is VALID [2022-04-15 11:34:59,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {70960#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:59,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {70960#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {70960#true} ~cond := #in~cond; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {70960#true} assume !(0 == ~cond); {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70960#true} {70960#true} #1254#return; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {70960#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {70960#true} {70960#true} #1218#return; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {70960#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {70960#true} is VALID [2022-04-15 11:34:59,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {70960#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {70960#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {70960#true} is VALID [2022-04-15 11:34:59,686 INFO L272 TraceCheckUtils]: 23: Hoare triple {70960#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:59,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,687 INFO L272 TraceCheckUtils]: 25: Hoare triple {70960#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:34:59,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {71043#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {70960#true} is VALID [2022-04-15 11:34:59,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~5; {70960#true} is VALID [2022-04-15 11:34:59,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {70960#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {70960#true} is VALID [2022-04-15 11:34:59,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,687 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {70960#true} {70960#true} #1176#return; {70960#true} is VALID [2022-04-15 11:34:59,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {70960#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {70960#true} is VALID [2022-04-15 11:34:59,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {70960#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {70960#true} is VALID [2022-04-15 11:34:59,688 INFO L272 TraceCheckUtils]: 33: Hoare triple {70960#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {70960#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {70960#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {70960#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {70960#true} {70960#true} #1178#return; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {70960#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L272 TraceCheckUtils]: 40: Hoare triple {70960#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {70960#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {70960#true} assume 0 == ~__BLAST_NONDET~2; {70960#true} is VALID [2022-04-15 11:34:59,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {70960#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {70960#true} {70960#true} #1180#return; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {70960#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {70960#true} {70960#true} #1220#return; {70960#true} is VALID [2022-04-15 11:34:59,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {70960#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L272 TraceCheckUtils]: 50: Hoare triple {70960#true} call stub_driver_init(); {71059#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:59,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {71059#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {70960#true} {70960#true} #1222#return; {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {70960#true} assume !!(~status~5 >= 0); {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {70960#true} assume !(0 == ~__BLAST_NONDET~0); {70960#true} is VALID [2022-04-15 11:34:59,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {70960#true} assume !(1 == ~__BLAST_NONDET~0); {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {70960#true} assume !(2 == ~__BLAST_NONDET~0); {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {70960#true} assume 3 == ~__BLAST_NONDET~0; {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L272 TraceCheckUtils]: 59: Hoare triple {70960#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {70960#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {70960#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {70960#true} is VALID [2022-04-15 11:34:59,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {70960#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {70960#true} is VALID [2022-04-15 11:34:59,693 INFO L272 TraceCheckUtils]: 63: Hoare triple {70960#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:34:59,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {71038#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {70960#true} is VALID [2022-04-15 11:34:59,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {70960#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {70960#true} is VALID [2022-04-15 11:34:59,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {70960#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {70960#true} is VALID [2022-04-15 11:34:59,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {70960#true} assume #res.base == dest.base && #res.offset == dest.offset; {70960#true} is VALID [2022-04-15 11:34:59,694 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {70960#true} {70960#true} #1186#return; {70960#true} is VALID [2022-04-15 11:34:59,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {70960#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {70960#true} is VALID [2022-04-15 11:34:59,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {70960#true} assume !(~s~0 != ~NP~0); {70960#true} is VALID [2022-04-15 11:34:59,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {70960#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {70960#true} is VALID [2022-04-15 11:34:59,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {70960#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {70960#true} is VALID [2022-04-15 11:34:59,695 INFO L272 TraceCheckUtils]: 73: Hoare triple {70960#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {71060#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:34:59,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {71060#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {70960#true} is VALID [2022-04-15 11:34:59,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {70960#true} assume 0 != ~compRegistered~0; {70960#true} is VALID [2022-04-15 11:34:59,696 INFO L272 TraceCheckUtils]: 76: Hoare triple {70960#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:59,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L272 TraceCheckUtils]: 78: Hoare triple {70960#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:34:59,697 INFO L290 TraceCheckUtils]: 79: Hoare triple {71073#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L290 TraceCheckUtils]: 80: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {70960#true} {70960#true} #1174#return; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {70960#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {70960#true} {70960#true} #1210#return; {70960#true} is VALID [2022-04-15 11:34:59,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {70960#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {70960#true} assume -1073741802 == ~compRetStatus~0; {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L272 TraceCheckUtils]: 87: Hoare triple {70960#true} call stubMoreProcessingRequired(); {71077#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:34:59,698 INFO L290 TraceCheckUtils]: 88: Hoare triple {71077#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L290 TraceCheckUtils]: 89: Hoare triple {70960#true} assume true; {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {70960#true} {70960#true} #1212#return; {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L290 TraceCheckUtils]: 91: Hoare triple {70960#true} assume !(0 == ~__BLAST_NONDET~11); {70960#true} is VALID [2022-04-15 11:34:59,698 INFO L290 TraceCheckUtils]: 92: Hoare triple {70960#true} assume 1 == ~__BLAST_NONDET~11; {70960#true} is VALID [2022-04-15 11:34:59,699 INFO L290 TraceCheckUtils]: 93: Hoare triple {70960#true} ~returnVal2~0 := -1073741823; {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,699 INFO L290 TraceCheckUtils]: 94: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,699 INFO L290 TraceCheckUtils]: 95: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 96: Hoare triple {71072#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 97: Hoare triple {70961#false} #res := ~returnVal2~0; {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {70961#false} assume true; {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {70961#false} {70960#true} #1192#return; {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {70961#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {70961#false} assume !(259 == ~status~3); {70961#false} is VALID [2022-04-15 11:34:59,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {70961#false} assume !(~status~3 >= 0); {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L290 TraceCheckUtils]: 103: Hoare triple {70961#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L272 TraceCheckUtils]: 104: Hoare triple {70961#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {70961#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {70961#false} assume !(~s~0 == ~NP~0); {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L272 TraceCheckUtils]: 107: Hoare triple {70961#false} call errorFn(); {70961#false} is VALID [2022-04-15 11:34:59,701 INFO L290 TraceCheckUtils]: 108: Hoare triple {70961#false} assume !false; {70961#false} is VALID [2022-04-15 11:34:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:34:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420880298] [2022-04-15 11:34:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420880298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:59,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:59,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:59,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188961637] [2022-04-15 11:34:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188961637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:59,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:59,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:34:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137545371] [2022-04-15 11:34:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:59,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:34:59,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:59,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:34:59,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:59,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:34:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:34:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:34:59,788 INFO L87 Difference]: Start difference. First operand 321 states and 377 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:01,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:06,663 INFO L93 Difference]: Finished difference Result 471 states and 566 transitions. [2022-04-15 11:35:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:35:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:35:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2022-04-15 11:35:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2022-04-15 11:35:06,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 250 transitions. [2022-04-15 11:35:07,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:07,048 INFO L225 Difference]: With dead ends: 471 [2022-04-15 11:35:07,048 INFO L226 Difference]: Without dead ends: 383 [2022-04-15 11:35:07,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:35:07,052 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 378 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 207 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:07,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 283 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 11:35:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-15 11:35:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 327. [2022-04-15 11:35:07,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:07,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:07,766 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:07,766 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:07,771 INFO L93 Difference]: Finished difference Result 383 states and 451 transitions. [2022-04-15 11:35:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 451 transitions. [2022-04-15 11:35:07,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:07,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:07,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 383 states. [2022-04-15 11:35:07,773 INFO L87 Difference]: Start difference. First operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 383 states. [2022-04-15 11:35:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:07,780 INFO L93 Difference]: Finished difference Result 383 states and 451 transitions. [2022-04-15 11:35:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 451 transitions. [2022-04-15 11:35:07,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:07,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:07,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:07,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 254 states have (on average 1.2165354330708662) internal successors, (309), 258 states have internal predecessors, (309), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 383 transitions. [2022-04-15 11:35:07,789 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 383 transitions. Word has length 109 [2022-04-15 11:35:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:07,790 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 383 transitions. [2022-04-15 11:35:07,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:07,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 383 transitions. [2022-04-15 11:35:08,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 383 transitions. [2022-04-15 11:35:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:35:08,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:08,753 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:08,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:35:08,753 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -979484737, now seen corresponding path program 1 times [2022-04-15 11:35:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:08,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [752372584] [2022-04-15 11:35:08,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:35:08,757 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:35:08,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash -979484737, now seen corresponding path program 2 times [2022-04-15 11:35:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:08,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909293649] [2022-04-15 11:35:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:08,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {73532#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {73454#true} is VALID [2022-04-15 11:35:08,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:08,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73454#true} {73454#true} #1270#return; {73454#true} is VALID [2022-04-15 11:35:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:08,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {73533#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {73454#true} is VALID [2022-04-15 11:35:08,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:08,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73454#true} {73454#true} #1216#return; {73454#true} is VALID [2022-04-15 11:35:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:35:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {73454#true} ~cond := #in~cond; {73454#true} is VALID [2022-04-15 11:35:09,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume !(0 == ~cond); {73454#true} is VALID [2022-04-15 11:35:09,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73454#true} {73454#true} #1254#return; {73454#true} is VALID [2022-04-15 11:35:09,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {73454#true} is VALID [2022-04-15 11:35:09,023 INFO L272 TraceCheckUtils]: 1: Hoare triple {73454#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} ~cond := #in~cond; {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume !(0 == ~cond); {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {73454#true} {73454#true} #1254#return; {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {73454#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,024 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {73454#true} {73454#true} #1218#return; {73454#true} is VALID [2022-04-15 11:35:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:35:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {73454#true} is VALID [2022-04-15 11:35:09,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~5; {73454#true} is VALID [2022-04-15 11:35:09,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {73454#true} is VALID [2022-04-15 11:35:09,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,069 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73454#true} {73454#true} #1176#return; {73454#true} is VALID [2022-04-15 11:35:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:35:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {73454#true} is VALID [2022-04-15 11:35:09,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {73454#true} is VALID [2022-04-15 11:35:09,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {73454#true} is VALID [2022-04-15 11:35:09,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {73454#true} is VALID [2022-04-15 11:35:09,077 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73454#true} {73454#true} #1178#return; {73454#true} is VALID [2022-04-15 11:35:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:35:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {73454#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {73454#true} is VALID [2022-04-15 11:35:09,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~2; {73454#true} is VALID [2022-04-15 11:35:09,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {73454#true} is VALID [2022-04-15 11:35:09,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,087 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73454#true} {73454#true} #1180#return; {73454#true} is VALID [2022-04-15 11:35:09,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,088 INFO L272 TraceCheckUtils]: 1: Hoare triple {73454#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:09,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {73454#true} is VALID [2022-04-15 11:35:09,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~5; {73454#true} is VALID [2022-04-15 11:35:09,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {73454#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {73454#true} is VALID [2022-04-15 11:35:09,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,089 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {73454#true} {73454#true} #1176#return; {73454#true} is VALID [2022-04-15 11:35:09,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {73454#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {73454#true} is VALID [2022-04-15 11:35:09,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {73454#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L272 TraceCheckUtils]: 9: Hoare triple {73454#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {73454#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {73454#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {73454#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {73454#true} {73454#true} #1178#return; {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {73454#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L272 TraceCheckUtils]: 16: Hoare triple {73454#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {73454#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {73454#true} is VALID [2022-04-15 11:35:09,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~2; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {73454#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {73454#true} {73454#true} #1180#return; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {73454#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,091 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {73454#true} {73454#true} #1220#return; {73454#true} is VALID [2022-04-15 11:35:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:35:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {73555#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73454#true} {73454#true} #1222#return; {73454#true} is VALID [2022-04-15 11:35:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:35:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {73454#true} is VALID [2022-04-15 11:35:09,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {73454#true} is VALID [2022-04-15 11:35:09,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {73454#true} is VALID [2022-04-15 11:35:09,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume #res.base == dest.base && #res.offset == dest.offset; {73454#true} is VALID [2022-04-15 11:35:09,120 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73454#true} {73454#true} #1186#return; {73454#true} is VALID [2022-04-15 11:35:09,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:35:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:35:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {73454#true} is VALID [2022-04-15 11:35:09,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73454#true} {73454#true} #1174#return; {73454#true} is VALID [2022-04-15 11:35:09,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L272 TraceCheckUtils]: 1: Hoare triple {73454#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:09,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73454#true} {73454#true} #1174#return; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {73454#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,197 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73454#true} {73454#true} #1210#return; {73454#true} is VALID [2022-04-15 11:35:09,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:35:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:09,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {73574#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {73454#true} is VALID [2022-04-15 11:35:09,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73454#true} {73454#true} #1212#return; {73454#true} is VALID [2022-04-15 11:35:09,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {73556#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {73454#true} is VALID [2022-04-15 11:35:09,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {73454#true} assume 0 != ~compRegistered~0; {73454#true} is VALID [2022-04-15 11:35:09,217 INFO L272 TraceCheckUtils]: 2: Hoare triple {73454#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:09,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {73454#true} is VALID [2022-04-15 11:35:09,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {73454#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73454#true} {73454#true} #1174#return; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {73454#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {73454#true} {73454#true} #1210#return; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {73454#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {73454#true} is VALID [2022-04-15 11:35:09,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {73454#true} assume -1073741802 == ~compRetStatus~0; {73454#true} is VALID [2022-04-15 11:35:09,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {73454#true} call stubMoreProcessingRequired(); {73574#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:09,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {73574#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {73454#true} is VALID [2022-04-15 11:35:09,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,219 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73454#true} {73454#true} #1212#return; {73454#true} is VALID [2022-04-15 11:35:09,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {73454#true} assume !(0 == ~__BLAST_NONDET~11); {73454#true} is VALID [2022-04-15 11:35:09,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {73454#true} assume !(1 == ~__BLAST_NONDET~11); {73454#true} is VALID [2022-04-15 11:35:09,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {73454#true} ~returnVal2~0 := 259; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {73569#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:35:09,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {73569#(<= 259 |IofCallDriver_#res|)} assume true; {73569#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:35:09,240 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {73569#(<= 259 |IofCallDriver_#res|)} {73454#true} #1192#return; {73530#(<= 259 |KbFilter_PnP_#t~ret109|)} is VALID [2022-04-15 11:35:09,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {73454#true} call ULTIMATE.init(); {73532#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:09,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {73532#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73454#true} {73454#true} #1270#return; {73454#true} is VALID [2022-04-15 11:35:09,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {73454#true} call #t~ret213 := main(); {73454#true} is VALID [2022-04-15 11:35:09,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {73454#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {73454#true} is VALID [2022-04-15 11:35:09,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {73454#true} call _BLAST_init(); {73533#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:09,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {73533#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,244 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {73454#true} {73454#true} #1216#return; {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {73454#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:09,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {73454#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {73454#true} ~cond := #in~cond; {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {73454#true} assume !(0 == ~cond); {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73454#true} {73454#true} #1254#return; {73454#true} is VALID [2022-04-15 11:35:09,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {73454#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {73454#true} is VALID [2022-04-15 11:35:09,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,246 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {73454#true} {73454#true} #1218#return; {73454#true} is VALID [2022-04-15 11:35:09,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {73454#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {73454#true} is VALID [2022-04-15 11:35:09,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {73454#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {73454#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {73454#true} is VALID [2022-04-15 11:35:09,247 INFO L272 TraceCheckUtils]: 23: Hoare triple {73454#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:09,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,248 INFO L272 TraceCheckUtils]: 25: Hoare triple {73454#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:09,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {73539#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {73454#true} is VALID [2022-04-15 11:35:09,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~5; {73454#true} is VALID [2022-04-15 11:35:09,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {73454#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {73454#true} is VALID [2022-04-15 11:35:09,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,249 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {73454#true} {73454#true} #1176#return; {73454#true} is VALID [2022-04-15 11:35:09,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {73454#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {73454#true} is VALID [2022-04-15 11:35:09,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {73454#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L272 TraceCheckUtils]: 33: Hoare triple {73454#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:09,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {73454#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {73454#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {73454#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {73454#true} {73454#true} #1178#return; {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {73454#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {73454#true} is VALID [2022-04-15 11:35:09,250 INFO L272 TraceCheckUtils]: 40: Hoare triple {73454#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {73454#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {73454#true} assume 0 == ~__BLAST_NONDET~2; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {73454#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {73454#true} {73454#true} #1180#return; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {73454#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {73454#true} {73454#true} #1220#return; {73454#true} is VALID [2022-04-15 11:35:09,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {73454#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {73454#true} is VALID [2022-04-15 11:35:09,252 INFO L272 TraceCheckUtils]: 50: Hoare triple {73454#true} call stub_driver_init(); {73555#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:09,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {73555#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {73454#true} is VALID [2022-04-15 11:35:09,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,252 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {73454#true} {73454#true} #1222#return; {73454#true} is VALID [2022-04-15 11:35:09,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {73454#true} assume !!(~status~5 >= 0); {73454#true} is VALID [2022-04-15 11:35:09,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {73454#true} assume !(0 == ~__BLAST_NONDET~0); {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {73454#true} assume !(1 == ~__BLAST_NONDET~0); {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {73454#true} assume !(2 == ~__BLAST_NONDET~0); {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {73454#true} assume 3 == ~__BLAST_NONDET~0; {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L272 TraceCheckUtils]: 59: Hoare triple {73454#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {73454#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {73454#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {73454#true} is VALID [2022-04-15 11:35:09,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {73454#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {73454#true} is VALID [2022-04-15 11:35:09,254 INFO L272 TraceCheckUtils]: 63: Hoare triple {73454#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:09,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {73534#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {73454#true} is VALID [2022-04-15 11:35:09,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {73454#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {73454#true} is VALID [2022-04-15 11:35:09,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {73454#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {73454#true} is VALID [2022-04-15 11:35:09,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {73454#true} assume #res.base == dest.base && #res.offset == dest.offset; {73454#true} is VALID [2022-04-15 11:35:09,254 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {73454#true} {73454#true} #1186#return; {73454#true} is VALID [2022-04-15 11:35:09,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {73454#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {73454#true} is VALID [2022-04-15 11:35:09,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {73454#true} assume !(~s~0 != ~NP~0); {73454#true} is VALID [2022-04-15 11:35:09,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {73454#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {73454#true} is VALID [2022-04-15 11:35:09,255 INFO L290 TraceCheckUtils]: 72: Hoare triple {73454#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {73454#true} is VALID [2022-04-15 11:35:09,256 INFO L272 TraceCheckUtils]: 73: Hoare triple {73454#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {73556#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:09,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {73556#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {73454#true} is VALID [2022-04-15 11:35:09,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {73454#true} assume 0 != ~compRegistered~0; {73454#true} is VALID [2022-04-15 11:35:09,257 INFO L272 TraceCheckUtils]: 76: Hoare triple {73454#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:09,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {73454#true} is VALID [2022-04-15 11:35:09,257 INFO L272 TraceCheckUtils]: 78: Hoare triple {73454#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:09,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {73570#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L290 TraceCheckUtils]: 80: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {73454#true} {73454#true} #1174#return; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {73454#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L290 TraceCheckUtils]: 83: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {73454#true} {73454#true} #1210#return; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L290 TraceCheckUtils]: 85: Hoare triple {73454#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {73454#true} assume -1073741802 == ~compRetStatus~0; {73454#true} is VALID [2022-04-15 11:35:09,258 INFO L272 TraceCheckUtils]: 87: Hoare triple {73454#true} call stubMoreProcessingRequired(); {73574#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:09,259 INFO L290 TraceCheckUtils]: 88: Hoare triple {73574#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {73454#true} is VALID [2022-04-15 11:35:09,259 INFO L290 TraceCheckUtils]: 89: Hoare triple {73454#true} assume true; {73454#true} is VALID [2022-04-15 11:35:09,259 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {73454#true} {73454#true} #1212#return; {73454#true} is VALID [2022-04-15 11:35:09,259 INFO L290 TraceCheckUtils]: 91: Hoare triple {73454#true} assume !(0 == ~__BLAST_NONDET~11); {73454#true} is VALID [2022-04-15 11:35:09,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {73454#true} assume !(1 == ~__BLAST_NONDET~11); {73454#true} is VALID [2022-04-15 11:35:09,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {73454#true} ~returnVal2~0 := 259; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,260 INFO L290 TraceCheckUtils]: 95: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,260 INFO L290 TraceCheckUtils]: 96: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {73568#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 11:35:09,260 INFO L290 TraceCheckUtils]: 97: Hoare triple {73568#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {73569#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:35:09,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {73569#(<= 259 |IofCallDriver_#res|)} assume true; {73569#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 11:35:09,262 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {73569#(<= 259 |IofCallDriver_#res|)} {73454#true} #1192#return; {73530#(<= 259 |KbFilter_PnP_#t~ret109|)} is VALID [2022-04-15 11:35:09,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {73530#(<= 259 |KbFilter_PnP_#t~ret109|)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {73531#(<= 259 KbFilter_PnP_~status~3)} is VALID [2022-04-15 11:35:09,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {73531#(<= 259 KbFilter_PnP_~status~3)} assume !(259 == ~status~3); {73531#(<= 259 KbFilter_PnP_~status~3)} is VALID [2022-04-15 11:35:09,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {73531#(<= 259 KbFilter_PnP_~status~3)} assume !(~status~3 >= 0); {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {73455#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L272 TraceCheckUtils]: 104: Hoare triple {73455#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {73455#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {73455#false} assume !(~s~0 == ~NP~0); {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L272 TraceCheckUtils]: 107: Hoare triple {73455#false} call errorFn(); {73455#false} is VALID [2022-04-15 11:35:09,263 INFO L290 TraceCheckUtils]: 108: Hoare triple {73455#false} assume !false; {73455#false} is VALID [2022-04-15 11:35:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:35:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909293649] [2022-04-15 11:35:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909293649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:09,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:09,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [752372584] [2022-04-15 11:35:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [752372584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:09,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:09,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12567499] [2022-04-15 11:35:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:09,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:35:09,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:09,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:09,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:09,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:35:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:35:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:35:09,373 INFO L87 Difference]: Start difference. First operand 327 states and 383 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:11,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:20,471 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-15 11:35:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:35:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2022-04-15 11:35:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 234 transitions. [2022-04-15 11:35:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 234 transitions. [2022-04-15 11:35:20,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 234 transitions. [2022-04-15 11:35:20,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:20,758 INFO L225 Difference]: With dead ends: 425 [2022-04-15 11:35:20,758 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:35:20,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:35:20,758 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 265 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:20,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 481 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 833 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 11:35:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:35:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 337. [2022-04-15 11:35:21,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:21,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:21,448 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:21,448 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:21,454 INFO L93 Difference]: Finished difference Result 396 states and 467 transitions. [2022-04-15 11:35:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 467 transitions. [2022-04-15 11:35:21,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:21,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:21,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 396 states. [2022-04-15 11:35:21,456 INFO L87 Difference]: Start difference. First operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 396 states. [2022-04-15 11:35:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:21,461 INFO L93 Difference]: Finished difference Result 396 states and 467 transitions. [2022-04-15 11:35:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 467 transitions. [2022-04-15 11:35:21,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:21,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:21,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:21,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 266 states have internal predecessors, (317), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 393 transitions. [2022-04-15 11:35:21,477 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 393 transitions. Word has length 109 [2022-04-15 11:35:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:21,477 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 393 transitions. [2022-04-15 11:35:21,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:21,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 393 transitions. [2022-04-15 11:35:22,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 393 transitions. [2022-04-15 11:35:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:35:22,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:22,444 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:22,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:35:22,444 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1216749988, now seen corresponding path program 1 times [2022-04-15 11:35:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499074418] [2022-04-15 11:35:22,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:35:22,447 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:35:22,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1216749988, now seen corresponding path program 2 times [2022-04-15 11:35:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:22,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982867868] [2022-04-15 11:35:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {75985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75907#true} {75907#true} #1270#return; {75907#true} is VALID [2022-04-15 11:35:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {75986#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:35:22,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} assume true; {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:35:22,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} {75907#true} #1216#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:35:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {75907#true} ~cond := #in~cond; {75907#true} is VALID [2022-04-15 11:35:22,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume !(0 == ~cond); {75907#true} is VALID [2022-04-15 11:35:22,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75907#true} {75907#true} #1254#return; {75907#true} is VALID [2022-04-15 11:35:22,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L272 TraceCheckUtils]: 1: Hoare triple {75907#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} ~cond := #in~cond; {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume !(0 == ~cond); {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {75907#true} {75907#true} #1254#return; {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {75907#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {75907#true} is VALID [2022-04-15 11:35:22,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,787 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1218#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:35:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {75907#true} is VALID [2022-04-15 11:35:22,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~5; {75907#true} is VALID [2022-04-15 11:35:22,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {75907#true} is VALID [2022-04-15 11:35:22,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,841 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75907#true} {75907#true} #1176#return; {75907#true} is VALID [2022-04-15 11:35:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:35:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {75907#true} is VALID [2022-04-15 11:35:22,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {75907#true} is VALID [2022-04-15 11:35:22,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {75907#true} is VALID [2022-04-15 11:35:22,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {75907#true} is VALID [2022-04-15 11:35:22,849 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75907#true} {75907#true} #1178#return; {75907#true} is VALID [2022-04-15 11:35:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:35:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {75907#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {75907#true} is VALID [2022-04-15 11:35:22,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~2; {75907#true} is VALID [2022-04-15 11:35:22,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {75907#true} is VALID [2022-04-15 11:35:22,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,857 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75907#true} {75907#true} #1180#return; {75907#true} is VALID [2022-04-15 11:35:22,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,858 INFO L272 TraceCheckUtils]: 1: Hoare triple {75907#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:22,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {75907#true} is VALID [2022-04-15 11:35:22,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~5; {75907#true} is VALID [2022-04-15 11:35:22,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {75907#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {75907#true} is VALID [2022-04-15 11:35:22,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,859 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75907#true} {75907#true} #1176#return; {75907#true} is VALID [2022-04-15 11:35:22,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {75907#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {75907#true} is VALID [2022-04-15 11:35:22,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {75907#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {75907#true} is VALID [2022-04-15 11:35:22,859 INFO L272 TraceCheckUtils]: 9: Hoare triple {75907#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {75907#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {75907#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {75907#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {75907#true} {75907#true} #1178#return; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {75907#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L272 TraceCheckUtils]: 16: Hoare triple {75907#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {75907#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~2; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {75907#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {75907#true} is VALID [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,861 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75907#true} {75907#true} #1180#return; {75907#true} is VALID [2022-04-15 11:35:22,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {75907#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {75907#true} is VALID [2022-04-15 11:35:22,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,862 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1220#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:35:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {76009#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1222#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:35:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {75907#true} is VALID [2022-04-15 11:35:22,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {75907#true} is VALID [2022-04-15 11:35:22,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {75907#true} is VALID [2022-04-15 11:35:22,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume #res.base == dest.base && #res.offset == dest.offset; {75907#true} is VALID [2022-04-15 11:35:22,893 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1186#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:35:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:35:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {75907#true} is VALID [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75907#true} {75907#true} #1174#return; {75907#true} is VALID [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {75907#true} is VALID [2022-04-15 11:35:22,957 INFO L272 TraceCheckUtils]: 1: Hoare triple {75907#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {75907#true} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,957 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75907#true} {75907#true} #1174#return; {75907#true} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {75907#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {75907#true} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,958 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75907#true} {75907#true} #1210#return; {75907#true} is VALID [2022-04-15 11:35:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:35:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {76027#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {75907#true} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75907#true} {75907#true} #1212#return; {75907#true} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {76010#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {75907#true} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {75907#true} assume 0 != ~compRegistered~0; {75907#true} is VALID [2022-04-15 11:35:22,975 INFO L272 TraceCheckUtils]: 2: Hoare triple {75907#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {75907#true} is VALID [2022-04-15 11:35:22,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {75907#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:22,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {75907#true} is VALID [2022-04-15 11:35:22,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,976 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75907#true} {75907#true} #1174#return; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {75907#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75907#true} {75907#true} #1210#return; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {75907#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {75907#true} assume -1073741802 == ~compRetStatus~0; {75907#true} is VALID [2022-04-15 11:35:22,977 INFO L272 TraceCheckUtils]: 13: Hoare triple {75907#true} call stubMoreProcessingRequired(); {76027#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {76027#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75907#true} {75907#true} #1212#return; {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {75907#true} assume !(0 == ~__BLAST_NONDET~11); {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {75907#true} assume 1 == ~__BLAST_NONDET~11; {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {75907#true} ~returnVal2~0 := -1073741823; {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {75907#true} assume !(~s~0 == ~NP~0); {75907#true} is VALID [2022-04-15 11:35:22,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {75907#true} assume ~s~0 == ~MPR1~0; {75907#true} is VALID [2022-04-15 11:35:22,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {75907#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:22,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} #res := ~returnVal2~0; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:22,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} assume true; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:22,980 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1192#return; {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {75907#true} call ULTIMATE.init(); {75985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:22,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {75985#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75907#true} {75907#true} #1270#return; {75907#true} is VALID [2022-04-15 11:35:22,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {75907#true} call #t~ret213 := main(); {75907#true} is VALID [2022-04-15 11:35:22,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {75907#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {75907#true} is VALID [2022-04-15 11:35:22,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {75907#true} call _BLAST_init(); {75986#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {75986#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:35:22,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} assume true; {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 11:35:22,985 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {75987#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} {75907#true} #1216#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,986 INFO L272 TraceCheckUtils]: 10: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:22,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {75907#true} is VALID [2022-04-15 11:35:22,986 INFO L272 TraceCheckUtils]: 12: Hoare triple {75907#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {75907#true} is VALID [2022-04-15 11:35:22,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {75907#true} ~cond := #in~cond; {75907#true} is VALID [2022-04-15 11:35:22,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {75907#true} assume !(0 == ~cond); {75907#true} is VALID [2022-04-15 11:35:22,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,987 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75907#true} {75907#true} #1254#return; {75907#true} is VALID [2022-04-15 11:35:22,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {75907#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {75907#true} is VALID [2022-04-15 11:35:22,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,988 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1218#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,990 INFO L272 TraceCheckUtils]: 23: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:22,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L272 TraceCheckUtils]: 25: Hoare triple {75907#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {75993#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~5; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {75907#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {75907#true} {75907#true} #1176#return; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {75907#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {75907#true} is VALID [2022-04-15 11:35:22,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {75907#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {75907#true} is VALID [2022-04-15 11:35:22,993 INFO L272 TraceCheckUtils]: 33: Hoare triple {75907#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:22,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {75907#true} is VALID [2022-04-15 11:35:22,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {75907#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {75907#true} is VALID [2022-04-15 11:35:22,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {75907#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {75907#true} is VALID [2022-04-15 11:35:22,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {75907#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {75907#true} {75907#true} #1178#return; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {75907#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L272 TraceCheckUtils]: 40: Hoare triple {75907#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {75907#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {75907#true} assume 0 == ~__BLAST_NONDET~2; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {75907#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {75907#true} {75907#true} #1180#return; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {75907#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {75907#true} is VALID [2022-04-15 11:35:22,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,995 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1220#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,996 INFO L272 TraceCheckUtils]: 50: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call stub_driver_init(); {76009#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {76009#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {75907#true} is VALID [2022-04-15 11:35:22,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:22,997 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1222#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !!(~status~5 >= 0); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(0 == ~__BLAST_NONDET~0); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,998 INFO L290 TraceCheckUtils]: 56: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(1 == ~__BLAST_NONDET~0); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(2 == ~__BLAST_NONDET~0); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:22,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume 3 == ~__BLAST_NONDET~0; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,001 INFO L272 TraceCheckUtils]: 59: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume 0 == #t~mem81 % 256;havoc #t~mem81; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,004 INFO L272 TraceCheckUtils]: 63: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:23,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {75988#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {75907#true} is VALID [2022-04-15 11:35:23,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {75907#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {75907#true} is VALID [2022-04-15 11:35:23,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {75907#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {75907#true} is VALID [2022-04-15 11:35:23,005 INFO L290 TraceCheckUtils]: 67: Hoare triple {75907#true} assume #res.base == dest.base && #res.offset == dest.offset; {75907#true} is VALID [2022-04-15 11:35:23,006 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {75907#true} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1186#return; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(~s~0 != ~NP~0); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,009 INFO L272 TraceCheckUtils]: 73: Hoare triple {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {76010#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:23,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {76010#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {75907#true} is VALID [2022-04-15 11:35:23,009 INFO L290 TraceCheckUtils]: 75: Hoare triple {75907#true} assume 0 != ~compRegistered~0; {75907#true} is VALID [2022-04-15 11:35:23,010 INFO L272 TraceCheckUtils]: 76: Hoare triple {75907#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:23,010 INFO L290 TraceCheckUtils]: 77: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {75907#true} is VALID [2022-04-15 11:35:23,011 INFO L272 TraceCheckUtils]: 78: Hoare triple {75907#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:23,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {76023#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {75907#true} is VALID [2022-04-15 11:35:23,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:23,011 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {75907#true} {75907#true} #1174#return; {75907#true} is VALID [2022-04-15 11:35:23,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {75907#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L290 TraceCheckUtils]: 83: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {75907#true} {75907#true} #1210#return; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {75907#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L290 TraceCheckUtils]: 86: Hoare triple {75907#true} assume -1073741802 == ~compRetStatus~0; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L272 TraceCheckUtils]: 87: Hoare triple {75907#true} call stubMoreProcessingRequired(); {76027#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:23,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {76027#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {75907#true} is VALID [2022-04-15 11:35:23,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {75907#true} assume true; {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {75907#true} {75907#true} #1212#return; {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 91: Hoare triple {75907#true} assume !(0 == ~__BLAST_NONDET~11); {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 92: Hoare triple {75907#true} assume 1 == ~__BLAST_NONDET~11; {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 93: Hoare triple {75907#true} ~returnVal2~0 := -1073741823; {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 94: Hoare triple {75907#true} assume !(~s~0 == ~NP~0); {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 95: Hoare triple {75907#true} assume ~s~0 == ~MPR1~0; {75907#true} is VALID [2022-04-15 11:35:23,013 INFO L290 TraceCheckUtils]: 96: Hoare triple {75907#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:23,014 INFO L290 TraceCheckUtils]: 97: Hoare triple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} #res := ~returnVal2~0; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:23,014 INFO L290 TraceCheckUtils]: 98: Hoare triple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} assume true; {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 11:35:23,015 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {76022#(or (= ~s~0 1) (= ~s~0 ~NP~0))} {75915#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #1192#return; {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,015 INFO L290 TraceCheckUtils]: 100: Hoare triple {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume 259 == ~status~3; {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,017 INFO L272 TraceCheckUtils]: 102: Hoare triple {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,017 INFO L290 TraceCheckUtils]: 103: Hoare triple {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 11:35:23,017 INFO L290 TraceCheckUtils]: 104: Hoare triple {75984#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume ~s~0 == ~MPR3~0; {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L290 TraceCheckUtils]: 105: Hoare triple {75908#false} assume !(1 == ~setEventCalled~0); {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L290 TraceCheckUtils]: 106: Hoare triple {75908#false} assume !(1 == ~customIrp~0); {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L290 TraceCheckUtils]: 107: Hoare triple {75908#false} assume ~s~0 == ~MPR3~0; {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L272 TraceCheckUtils]: 108: Hoare triple {75908#false} call errorFn(); {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L290 TraceCheckUtils]: 109: Hoare triple {75908#false} assume !false; {75908#false} is VALID [2022-04-15 11:35:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:35:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:23,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982867868] [2022-04-15 11:35:23,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982867868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:23,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:23,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:23,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:23,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499074418] [2022-04-15 11:35:23,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499074418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:23,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:23,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074713664] [2022-04-15 11:35:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2022-04-15 11:35:23,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:23,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:23,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:23,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:35:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:35:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:35:23,107 INFO L87 Difference]: Start difference. First operand 337 states and 393 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:25,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:30,649 INFO L93 Difference]: Finished difference Result 426 states and 498 transitions. [2022-04-15 11:35:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 11:35:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2022-04-15 11:35:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2022-04-15 11:35:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2022-04-15 11:35:30,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 271 transitions. [2022-04-15 11:35:30,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:30,973 INFO L225 Difference]: With dead ends: 426 [2022-04-15 11:35:30,973 INFO L226 Difference]: Without dead ends: 379 [2022-04-15 11:35:30,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2022-04-15 11:35:30,974 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 641 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 287 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:30,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 310 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:35:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-15 11:35:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 331. [2022-04-15 11:35:31,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:31,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:31,806 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:31,806 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:31,811 INFO L93 Difference]: Finished difference Result 379 states and 439 transitions. [2022-04-15 11:35:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2022-04-15 11:35:31,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:31,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:31,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 379 states. [2022-04-15 11:35:31,812 INFO L87 Difference]: Start difference. First operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) Second operand 379 states. [2022-04-15 11:35:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:31,820 INFO L93 Difference]: Finished difference Result 379 states and 439 transitions. [2022-04-15 11:35:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2022-04-15 11:35:31,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:31,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:31,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:31,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 256 states have (on average 1.18359375) internal successors, (303), 260 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 38 states have return successors, (40), 36 states have call predecessors, (40), 32 states have call successors, (40) [2022-04-15 11:35:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 379 transitions. [2022-04-15 11:35:31,829 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 379 transitions. Word has length 110 [2022-04-15 11:35:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:31,829 INFO L478 AbstractCegarLoop]: Abstraction has 331 states and 379 transitions. [2022-04-15 11:35:31,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (18), 12 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:31,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 331 states and 379 transitions. [2022-04-15 11:35:32,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 379 transitions. [2022-04-15 11:35:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:35:32,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:32,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:32,813 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:35:32,813 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1464166070, now seen corresponding path program 1 times [2022-04-15 11:35:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:32,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018843833] [2022-04-15 11:35:32,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:35:32,815 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:35:32,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1464166070, now seen corresponding path program 2 times [2022-04-15 11:35:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:32,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796989076] [2022-04-15 11:35:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:32,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {78420#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78342#true} {78342#true} #1270#return; {78342#true} is VALID [2022-04-15 11:35:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {78421#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78342#true} {78342#true} #1216#return; {78342#true} is VALID [2022-04-15 11:35:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:35:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {78342#true} ~cond := #in~cond; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume !(0 == ~cond); {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78342#true} {78342#true} #1254#return; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L272 TraceCheckUtils]: 1: Hoare triple {78342#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} ~cond := #in~cond; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume !(0 == ~cond); {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78342#true} {78342#true} #1254#return; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {78342#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {78342#true} is VALID [2022-04-15 11:35:33,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,069 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {78342#true} {78342#true} #1218#return; {78342#true} is VALID [2022-04-15 11:35:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:35:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {78342#true} is VALID [2022-04-15 11:35:33,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~5; {78342#true} is VALID [2022-04-15 11:35:33,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {78342#true} is VALID [2022-04-15 11:35:33,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,132 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78342#true} {78342#true} #1176#return; {78342#true} is VALID [2022-04-15 11:35:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:35:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {78342#true} is VALID [2022-04-15 11:35:33,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {78342#true} is VALID [2022-04-15 11:35:33,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {78342#true} is VALID [2022-04-15 11:35:33,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78342#true} is VALID [2022-04-15 11:35:33,141 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78342#true} {78342#true} #1178#return; {78342#true} is VALID [2022-04-15 11:35:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:35:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {78342#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {78342#true} is VALID [2022-04-15 11:35:33,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~2; {78342#true} is VALID [2022-04-15 11:35:33,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {78342#true} is VALID [2022-04-15 11:35:33,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,149 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78342#true} {78342#true} #1180#return; {78342#true} is VALID [2022-04-15 11:35:33,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,150 INFO L272 TraceCheckUtils]: 1: Hoare triple {78342#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:33,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~5; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {78342#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78342#true} {78342#true} #1176#return; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {78342#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {78342#true} is VALID [2022-04-15 11:35:33,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {78342#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L272 TraceCheckUtils]: 9: Hoare triple {78342#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:33,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {78342#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {78342#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {78342#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {78342#true} {78342#true} #1178#return; {78342#true} is VALID [2022-04-15 11:35:33,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {78342#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L272 TraceCheckUtils]: 16: Hoare triple {78342#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {78342#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~2; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {78342#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {78342#true} {78342#true} #1180#return; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {78342#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,153 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {78342#true} {78342#true} #1220#return; {78342#true} is VALID [2022-04-15 11:35:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:35:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {78443#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78342#true} {78342#true} #1222#return; {78342#true} is VALID [2022-04-15 11:35:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:35:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {78342#true} is VALID [2022-04-15 11:35:33,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {78342#true} is VALID [2022-04-15 11:35:33,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {78342#true} is VALID [2022-04-15 11:35:33,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume #res.base == dest.base && #res.offset == dest.offset; {78342#true} is VALID [2022-04-15 11:35:33,187 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78342#true} {78342#true} #1186#return; {78342#true} is VALID [2022-04-15 11:35:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:35:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:35:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {78342#true} is VALID [2022-04-15 11:35:33,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78342#true} {78342#true} #1174#return; {78342#true} is VALID [2022-04-15 11:35:33,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {78342#true} is VALID [2022-04-15 11:35:33,268 INFO L272 TraceCheckUtils]: 1: Hoare triple {78342#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:33,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {78342#true} is VALID [2022-04-15 11:35:33,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,269 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78342#true} {78342#true} #1174#return; {78342#true} is VALID [2022-04-15 11:35:33,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {78342#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {78342#true} is VALID [2022-04-15 11:35:33,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,269 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78342#true} {78342#true} #1210#return; {78342#true} is VALID [2022-04-15 11:35:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:35:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:33,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {78462#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {78342#true} is VALID [2022-04-15 11:35:33,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78342#true} {78342#true} #1212#return; {78342#true} is VALID [2022-04-15 11:35:33,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {78444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {78342#true} is VALID [2022-04-15 11:35:33,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {78342#true} assume 0 != ~compRegistered~0; {78342#true} is VALID [2022-04-15 11:35:33,289 INFO L272 TraceCheckUtils]: 2: Hoare triple {78342#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:33,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {78342#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:33,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78342#true} {78342#true} #1174#return; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {78342#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78342#true} {78342#true} #1210#return; {78342#true} is VALID [2022-04-15 11:35:33,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {78342#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {78342#true} assume -1073741802 == ~compRetStatus~0; {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {78342#true} call stubMoreProcessingRequired(); {78462#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:33,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {78462#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78342#true} {78342#true} #1212#return; {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {78342#true} assume !(0 == ~__BLAST_NONDET~11); {78342#true} is VALID [2022-04-15 11:35:33,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {78342#true} assume !(1 == ~__BLAST_NONDET~11); {78342#true} is VALID [2022-04-15 11:35:33,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {78342#true} ~returnVal2~0 := 259; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 11:35:33,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 11:35:33,294 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {78342#true} #1192#return; {78418#(and (<= 259 |KbFilter_PnP_#t~ret109|) (<= |KbFilter_PnP_#t~ret109| 259))} is VALID [2022-04-15 11:35:33,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {78342#true} call ULTIMATE.init(); {78420#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:33,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {78420#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78342#true} {78342#true} #1270#return; {78342#true} is VALID [2022-04-15 11:35:33,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {78342#true} call #t~ret213 := main(); {78342#true} is VALID [2022-04-15 11:35:33,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {78342#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {78342#true} is VALID [2022-04-15 11:35:33,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {78342#true} call _BLAST_init(); {78421#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:33,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {78421#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,297 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {78342#true} {78342#true} #1216#return; {78342#true} is VALID [2022-04-15 11:35:33,298 INFO L272 TraceCheckUtils]: 10: Hoare triple {78342#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:33,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {78342#true} is VALID [2022-04-15 11:35:33,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {78342#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {78342#true} is VALID [2022-04-15 11:35:33,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {78342#true} ~cond := #in~cond; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {78342#true} assume !(0 == ~cond); {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78342#true} {78342#true} #1254#return; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {78342#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {78342#true} {78342#true} #1218#return; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {78342#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {78342#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {78342#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {78342#true} is VALID [2022-04-15 11:35:33,300 INFO L272 TraceCheckUtils]: 23: Hoare triple {78342#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:33,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,301 INFO L272 TraceCheckUtils]: 25: Hoare triple {78342#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:33,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {78427#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~5; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {78342#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {78342#true} {78342#true} #1176#return; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {78342#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {78342#true} is VALID [2022-04-15 11:35:33,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {78342#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L272 TraceCheckUtils]: 33: Hoare triple {78342#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {78342#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {78342#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {78342#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78342#true} {78342#true} #1178#return; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {78342#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L272 TraceCheckUtils]: 40: Hoare triple {78342#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {78342#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {78342#true} assume 0 == ~__BLAST_NONDET~2; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {78342#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {78342#true} is VALID [2022-04-15 11:35:33,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {78342#true} {78342#true} #1180#return; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {78342#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {78342#true} {78342#true} #1220#return; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {78342#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {78342#true} is VALID [2022-04-15 11:35:33,304 INFO L272 TraceCheckUtils]: 50: Hoare triple {78342#true} call stub_driver_init(); {78443#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {78443#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {78342#true} {78342#true} #1222#return; {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {78342#true} assume !!(~status~5 >= 0); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {78342#true} assume !(0 == ~__BLAST_NONDET~0); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {78342#true} assume !(1 == ~__BLAST_NONDET~0); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {78342#true} assume !(2 == ~__BLAST_NONDET~0); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {78342#true} assume 3 == ~__BLAST_NONDET~0; {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L272 TraceCheckUtils]: 59: Hoare triple {78342#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {78342#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {78342#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {78342#true} is VALID [2022-04-15 11:35:33,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {78342#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {78342#true} is VALID [2022-04-15 11:35:33,306 INFO L272 TraceCheckUtils]: 63: Hoare triple {78342#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:33,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {78422#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {78342#true} is VALID [2022-04-15 11:35:33,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {78342#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {78342#true} is VALID [2022-04-15 11:35:33,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {78342#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {78342#true} assume #res.base == dest.base && #res.offset == dest.offset; {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {78342#true} {78342#true} #1186#return; {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {78342#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {78342#true} assume !(~s~0 != ~NP~0); {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {78342#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {78342#true} is VALID [2022-04-15 11:35:33,307 INFO L290 TraceCheckUtils]: 72: Hoare triple {78342#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {78342#true} is VALID [2022-04-15 11:35:33,308 INFO L272 TraceCheckUtils]: 73: Hoare triple {78342#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {78444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:33,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {78444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {78342#true} is VALID [2022-04-15 11:35:33,309 INFO L290 TraceCheckUtils]: 75: Hoare triple {78342#true} assume 0 != ~compRegistered~0; {78342#true} is VALID [2022-04-15 11:35:33,310 INFO L272 TraceCheckUtils]: 76: Hoare triple {78342#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:33,310 INFO L290 TraceCheckUtils]: 77: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L272 TraceCheckUtils]: 78: Hoare triple {78342#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {78458#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 80: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {78342#true} {78342#true} #1174#return; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 82: Hoare triple {78342#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 83: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {78342#true} {78342#true} #1210#return; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 85: Hoare triple {78342#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {78342#true} is VALID [2022-04-15 11:35:33,311 INFO L290 TraceCheckUtils]: 86: Hoare triple {78342#true} assume -1073741802 == ~compRetStatus~0; {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L272 TraceCheckUtils]: 87: Hoare triple {78342#true} call stubMoreProcessingRequired(); {78462#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:33,312 INFO L290 TraceCheckUtils]: 88: Hoare triple {78462#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L290 TraceCheckUtils]: 89: Hoare triple {78342#true} assume true; {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {78342#true} {78342#true} #1212#return; {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L290 TraceCheckUtils]: 91: Hoare triple {78342#true} assume !(0 == ~__BLAST_NONDET~11); {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L290 TraceCheckUtils]: 92: Hoare triple {78342#true} assume !(1 == ~__BLAST_NONDET~11); {78342#true} is VALID [2022-04-15 11:35:33,312 INFO L290 TraceCheckUtils]: 93: Hoare triple {78342#true} ~returnVal2~0 := 259; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,313 INFO L290 TraceCheckUtils]: 94: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,313 INFO L290 TraceCheckUtils]: 95: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,313 INFO L290 TraceCheckUtils]: 96: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:35:33,314 INFO L290 TraceCheckUtils]: 97: Hoare triple {78456#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 11:35:33,314 INFO L290 TraceCheckUtils]: 98: Hoare triple {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 11:35:33,315 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {78457#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {78342#true} #1192#return; {78418#(and (<= 259 |KbFilter_PnP_#t~ret109|) (<= |KbFilter_PnP_#t~ret109| 259))} is VALID [2022-04-15 11:35:33,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {78418#(and (<= 259 |KbFilter_PnP_#t~ret109|) (<= |KbFilter_PnP_#t~ret109| 259))} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {78419#(and (< 258 KbFilter_PnP_~status~3) (<= KbFilter_PnP_~status~3 259))} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 101: Hoare triple {78419#(and (< 258 KbFilter_PnP_~status~3) (<= KbFilter_PnP_~status~3 259))} assume !(259 == ~status~3); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 102: Hoare triple {78343#false} assume ~status~3 >= 0; {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 103: Hoare triple {78343#false} assume !(~myStatus~0 >= 0); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 104: Hoare triple {78343#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L272 TraceCheckUtils]: 105: Hoare triple {78343#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 106: Hoare triple {78343#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 107: Hoare triple {78343#false} assume !(~s~0 == ~NP~0); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L272 TraceCheckUtils]: 108: Hoare triple {78343#false} call errorFn(); {78343#false} is VALID [2022-04-15 11:35:33,316 INFO L290 TraceCheckUtils]: 109: Hoare triple {78343#false} assume !false; {78343#false} is VALID [2022-04-15 11:35:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:35:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796989076] [2022-04-15 11:35:33,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796989076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:33,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:33,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:33,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:33,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018843833] [2022-04-15 11:35:33,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018843833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:33,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:33,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:35:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100909097] [2022-04-15 11:35:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2022-04-15 11:35:33,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:33,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:33,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:33,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:35:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:35:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:35:33,408 INFO L87 Difference]: Start difference. First operand 331 states and 379 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:35,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:43,339 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-15 11:35:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:35:43,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2022-04-15 11:35:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 255 transitions. [2022-04-15 11:35:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 255 transitions. [2022-04-15 11:35:43,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 255 transitions. [2022-04-15 11:35:43,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:43,629 INFO L225 Difference]: With dead ends: 439 [2022-04-15 11:35:43,629 INFO L226 Difference]: Without dead ends: 370 [2022-04-15 11:35:43,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:35:43,630 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 272 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 140 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:43,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 448 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 776 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:35:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-04-15 11:35:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 321. [2022-04-15 11:35:44,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:44,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:44,441 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:44,442 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:44,446 INFO L93 Difference]: Finished difference Result 370 states and 425 transitions. [2022-04-15 11:35:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 425 transitions. [2022-04-15 11:35:44,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:44,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:44,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 370 states. [2022-04-15 11:35:44,447 INFO L87 Difference]: Start difference. First operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) Second operand 370 states. [2022-04-15 11:35:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:44,452 INFO L93 Difference]: Finished difference Result 370 states and 425 transitions. [2022-04-15 11:35:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 425 transitions. [2022-04-15 11:35:44,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:44,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:44,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:44,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 248 states have (on average 1.1653225806451613) internal successors, (289), 252 states have internal predecessors, (289), 36 states have call successors, (36), 34 states have call predecessors, (36), 36 states have return successors, (38), 34 states have call predecessors, (38), 32 states have call successors, (38) [2022-04-15 11:35:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 363 transitions. [2022-04-15 11:35:44,458 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 363 transitions. Word has length 110 [2022-04-15 11:35:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:44,458 INFO L478 AbstractCegarLoop]: Abstraction has 321 states and 363 transitions. [2022-04-15 11:35:44,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (18), 10 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-15 11:35:44,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 363 transitions. [2022-04-15 11:35:45,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 363 transitions. [2022-04-15 11:35:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:35:45,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:45,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:45,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:35:45,394 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1354625370, now seen corresponding path program 1 times [2022-04-15 11:35:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848401020] [2022-04-15 11:35:45,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:35:45,396 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:35:45,396 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1354625370, now seen corresponding path program 2 times [2022-04-15 11:35:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:45,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529623943] [2022-04-15 11:35:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {80816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80739#true} {80739#true} #1270#return; {80739#true} is VALID [2022-04-15 11:35:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {80817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80739#true} {80739#true} #1216#return; {80739#true} is VALID [2022-04-15 11:35:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:35:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {80739#true} ~cond := #in~cond; {80739#true} is VALID [2022-04-15 11:35:45,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume !(0 == ~cond); {80739#true} is VALID [2022-04-15 11:35:45,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80739#true} {80739#true} #1254#return; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L272 TraceCheckUtils]: 1: Hoare triple {80739#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} ~cond := #in~cond; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume !(0 == ~cond); {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {80739#true} {80739#true} #1254#return; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {80739#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,658 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {80739#true} {80739#true} #1218#return; {80739#true} is VALID [2022-04-15 11:35:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:35:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {80739#true} is VALID [2022-04-15 11:35:45,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~5; {80739#true} is VALID [2022-04-15 11:35:45,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {80739#true} is VALID [2022-04-15 11:35:45,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,699 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80739#true} {80739#true} #1176#return; {80739#true} is VALID [2022-04-15 11:35:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:35:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {80739#true} is VALID [2022-04-15 11:35:45,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {80739#true} is VALID [2022-04-15 11:35:45,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {80739#true} is VALID [2022-04-15 11:35:45,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {80739#true} is VALID [2022-04-15 11:35:45,712 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80739#true} {80739#true} #1178#return; {80739#true} is VALID [2022-04-15 11:35:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:35:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {80739#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {80739#true} is VALID [2022-04-15 11:35:45,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~2; {80739#true} is VALID [2022-04-15 11:35:45,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {80739#true} is VALID [2022-04-15 11:35:45,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,718 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80739#true} {80739#true} #1180#return; {80739#true} is VALID [2022-04-15 11:35:45,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L272 TraceCheckUtils]: 1: Hoare triple {80739#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:45,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~5; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {80739#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80739#true} {80739#true} #1176#return; {80739#true} is VALID [2022-04-15 11:35:45,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {80739#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {80739#true} is VALID [2022-04-15 11:35:45,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {80739#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {80739#true} is VALID [2022-04-15 11:35:45,720 INFO L272 TraceCheckUtils]: 9: Hoare triple {80739#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:45,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {80739#true} is VALID [2022-04-15 11:35:45,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {80739#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {80739#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {80739#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {80739#true} {80739#true} #1178#return; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {80739#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L272 TraceCheckUtils]: 16: Hoare triple {80739#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {80739#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~2; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {80739#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {80739#true} {80739#true} #1180#return; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {80739#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,721 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {80739#true} {80739#true} #1220#return; {80739#true} is VALID [2022-04-15 11:35:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:35:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {80839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80739#true} {80739#true} #1222#return; {80739#true} is VALID [2022-04-15 11:35:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:35:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {80739#true} is VALID [2022-04-15 11:35:45,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {80739#true} is VALID [2022-04-15 11:35:45,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {80739#true} is VALID [2022-04-15 11:35:45,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {80739#true} assume #res.base == dest.base && #res.offset == dest.offset; {80739#true} is VALID [2022-04-15 11:35:45,747 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80739#true} {80739#true} #1186#return; {80739#true} is VALID [2022-04-15 11:35:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:35:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:35:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1174#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {80739#true} is VALID [2022-04-15 11:35:45,803 INFO L272 TraceCheckUtils]: 1: Hoare triple {80739#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:45,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,804 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1174#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,806 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1210#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:35:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:45,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {80856#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {80739#true} is VALID [2022-04-15 11:35:45,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80739#true} {80815#(= ~setEventCalled~0 1)} #1212#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {80840#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {80739#true} is VALID [2022-04-15 11:35:45,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {80739#true} assume 0 != ~compRegistered~0; {80739#true} is VALID [2022-04-15 11:35:45,822 INFO L272 TraceCheckUtils]: 2: Hoare triple {80739#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:45,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {80739#true} is VALID [2022-04-15 11:35:45,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {80739#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:45,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,823 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1174#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1210#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -1073741802 == ~compRetStatus~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,826 INFO L272 TraceCheckUtils]: 13: Hoare triple {80815#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {80856#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:45,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {80856#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {80739#true} is VALID [2022-04-15 11:35:45,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,826 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {80739#true} {80815#(= ~setEventCalled~0 1)} #1212#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(0 == ~__BLAST_NONDET~11); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(1 == ~__BLAST_NONDET~11); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {80815#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {80815#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {80815#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {80815#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,829 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1192#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {80739#true} call ULTIMATE.init(); {80816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:45,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {80816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80739#true} {80739#true} #1270#return; {80739#true} is VALID [2022-04-15 11:35:45,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {80739#true} call #t~ret213 := main(); {80739#true} is VALID [2022-04-15 11:35:45,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {80739#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {80739#true} is VALID [2022-04-15 11:35:45,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {80739#true} call _BLAST_init(); {80817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:45,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {80817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,832 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {80739#true} {80739#true} #1216#return; {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L272 TraceCheckUtils]: 10: Hoare triple {80739#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:45,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {80739#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {80739#true} ~cond := #in~cond; {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {80739#true} assume !(0 == ~cond); {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,833 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {80739#true} {80739#true} #1254#return; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {80739#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {80739#true} {80739#true} #1218#return; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {80739#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {80739#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {80739#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {80739#true} is VALID [2022-04-15 11:35:45,835 INFO L272 TraceCheckUtils]: 23: Hoare triple {80739#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:45,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L272 TraceCheckUtils]: 25: Hoare triple {80739#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:45,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {80823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~5; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {80739#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {80739#true} {80739#true} #1176#return; {80739#true} is VALID [2022-04-15 11:35:45,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {80739#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {80739#true} is VALID [2022-04-15 11:35:45,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {80739#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {80739#true} is VALID [2022-04-15 11:35:45,837 INFO L272 TraceCheckUtils]: 33: Hoare triple {80739#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:45,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {80739#true} is VALID [2022-04-15 11:35:45,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {80739#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {80739#true} is VALID [2022-04-15 11:35:45,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {80739#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {80739#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {80739#true} {80739#true} #1178#return; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {80739#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L272 TraceCheckUtils]: 40: Hoare triple {80739#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {80739#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {80739#true} assume 0 == ~__BLAST_NONDET~2; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {80739#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {80739#true} {80739#true} #1180#return; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {80739#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {80739#true} {80739#true} #1220#return; {80739#true} is VALID [2022-04-15 11:35:45,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {80739#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L272 TraceCheckUtils]: 50: Hoare triple {80739#true} call stub_driver_init(); {80839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:45,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {80839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {80739#true} {80739#true} #1222#return; {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {80739#true} assume !!(~status~5 >= 0); {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {80739#true} assume !(0 == ~__BLAST_NONDET~0); {80739#true} is VALID [2022-04-15 11:35:45,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {80739#true} assume !(1 == ~__BLAST_NONDET~0); {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {80739#true} assume !(2 == ~__BLAST_NONDET~0); {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {80739#true} assume 3 == ~__BLAST_NONDET~0; {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L272 TraceCheckUtils]: 59: Hoare triple {80739#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {80739#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {80739#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {80739#true} is VALID [2022-04-15 11:35:45,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {80739#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L272 TraceCheckUtils]: 63: Hoare triple {80739#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:45,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {80818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {80739#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {80739#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {80739#true} assume #res.base == dest.base && #res.offset == dest.offset; {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {80739#true} {80739#true} #1186#return; {80739#true} is VALID [2022-04-15 11:35:45,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {80739#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {80739#true} is VALID [2022-04-15 11:35:45,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {80739#true} assume !(~s~0 != ~NP~0); {80739#true} is VALID [2022-04-15 11:35:45,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {80739#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {80739#true} is VALID [2022-04-15 11:35:45,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {80739#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {80739#true} is VALID [2022-04-15 11:35:45,842 INFO L272 TraceCheckUtils]: 73: Hoare triple {80739#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {80840#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:45,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {80840#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {80739#true} is VALID [2022-04-15 11:35:45,843 INFO L290 TraceCheckUtils]: 75: Hoare triple {80739#true} assume 0 != ~compRegistered~0; {80739#true} is VALID [2022-04-15 11:35:45,843 INFO L272 TraceCheckUtils]: 76: Hoare triple {80739#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:45,844 INFO L290 TraceCheckUtils]: 77: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {80739#true} is VALID [2022-04-15 11:35:45,844 INFO L272 TraceCheckUtils]: 78: Hoare triple {80739#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:45,844 INFO L290 TraceCheckUtils]: 79: Hoare triple {80852#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,845 INFO L290 TraceCheckUtils]: 80: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,845 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1174#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,847 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1210#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -1073741802 == ~compRetStatus~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,848 INFO L272 TraceCheckUtils]: 87: Hoare triple {80815#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {80856#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:45,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {80856#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {80739#true} is VALID [2022-04-15 11:35:45,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {80739#true} assume true; {80739#true} is VALID [2022-04-15 11:35:45,848 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {80739#true} {80815#(= ~setEventCalled~0 1)} #1212#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(0 == ~__BLAST_NONDET~11); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(1 == ~__BLAST_NONDET~11); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {80815#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,850 INFO L290 TraceCheckUtils]: 95: Hoare triple {80815#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,850 INFO L290 TraceCheckUtils]: 96: Hoare triple {80815#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,850 INFO L290 TraceCheckUtils]: 97: Hoare triple {80815#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,851 INFO L290 TraceCheckUtils]: 98: Hoare triple {80815#(= ~setEventCalled~0 1)} assume true; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,851 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {80815#(= ~setEventCalled~0 1)} {80739#true} #1192#return; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,852 INFO L290 TraceCheckUtils]: 100: Hoare triple {80815#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,852 INFO L290 TraceCheckUtils]: 101: Hoare triple {80815#(= ~setEventCalled~0 1)} assume 259 == ~status~3; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,852 INFO L272 TraceCheckUtils]: 102: Hoare triple {80815#(= ~setEventCalled~0 1)} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,853 INFO L290 TraceCheckUtils]: 103: Hoare triple {80815#(= ~setEventCalled~0 1)} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,853 INFO L290 TraceCheckUtils]: 104: Hoare triple {80815#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {80815#(= ~setEventCalled~0 1)} is VALID [2022-04-15 11:35:45,853 INFO L290 TraceCheckUtils]: 105: Hoare triple {80815#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {80740#false} is VALID [2022-04-15 11:35:45,853 INFO L290 TraceCheckUtils]: 106: Hoare triple {80740#false} assume !(1 == ~customIrp~0); {80740#false} is VALID [2022-04-15 11:35:45,853 INFO L290 TraceCheckUtils]: 107: Hoare triple {80740#false} assume ~s~0 == ~MPR3~0; {80740#false} is VALID [2022-04-15 11:35:45,854 INFO L272 TraceCheckUtils]: 108: Hoare triple {80740#false} call errorFn(); {80740#false} is VALID [2022-04-15 11:35:45,854 INFO L290 TraceCheckUtils]: 109: Hoare triple {80740#false} assume !false; {80740#false} is VALID [2022-04-15 11:35:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:35:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:45,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529623943] [2022-04-15 11:35:45,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529623943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:45,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:45,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:45,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:45,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848401020] [2022-04-15 11:35:45,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848401020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:45,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:45,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:45,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297734264] [2022-04-15 11:35:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2022-04-15 11:35:45,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:45,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:45,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:45,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:35:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:35:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:35:45,940 INFO L87 Difference]: Start difference. First operand 321 states and 363 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:48,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:53,266 INFO L93 Difference]: Finished difference Result 452 states and 515 transitions. [2022-04-15 11:35:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:35:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2022-04-15 11:35:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 256 transitions. [2022-04-15 11:35:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 256 transitions. [2022-04-15 11:35:53,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 256 transitions. [2022-04-15 11:35:53,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:53,553 INFO L225 Difference]: With dead ends: 452 [2022-04-15 11:35:53,553 INFO L226 Difference]: Without dead ends: 386 [2022-04-15 11:35:53,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:35:53,554 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 245 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:53,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 312 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 378 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:35:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-04-15 11:35:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2022-04-15 11:35:54,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:54,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) [2022-04-15 11:35:54,410 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) [2022-04-15 11:35:54,410 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) [2022-04-15 11:35:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:54,415 INFO L93 Difference]: Finished difference Result 386 states and 434 transitions. [2022-04-15 11:35:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 434 transitions. [2022-04-15 11:35:54,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:54,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:54,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) Second operand 386 states. [2022-04-15 11:35:54,416 INFO L87 Difference]: Start difference. First operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) Second operand 386 states. [2022-04-15 11:35:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:54,422 INFO L93 Difference]: Finished difference Result 386 states and 434 transitions. [2022-04-15 11:35:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 434 transitions. [2022-04-15 11:35:54,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:54,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:54,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:54,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 262 states have (on average 1.1450381679389312) internal successors, (300), 266 states have internal predecessors, (300), 36 states have call successors, (36), 35 states have call predecessors, (36), 39 states have return successors, (41), 36 states have call predecessors, (41), 33 states have call successors, (41) [2022-04-15 11:35:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 377 transitions. [2022-04-15 11:35:54,436 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 377 transitions. Word has length 110 [2022-04-15 11:35:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:54,436 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 377 transitions. [2022-04-15 11:35:54,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-15 11:35:54,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 338 states and 377 transitions. [2022-04-15 11:35:55,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 377 transitions. [2022-04-15 11:35:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-15 11:35:55,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:55,412 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:55,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:35:55,412 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 820803447, now seen corresponding path program 1 times [2022-04-15 11:35:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488718565] [2022-04-15 11:35:55,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:35:55,414 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:35:55,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash 820803447, now seen corresponding path program 2 times [2022-04-15 11:35:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:55,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25006370] [2022-04-15 11:35:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:55,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {83311#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {83227#true} is VALID [2022-04-15 11:35:55,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:55,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83227#true} {83227#true} #1270#return; {83227#true} is VALID [2022-04-15 11:35:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:55,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {83312#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:55,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:55,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83227#true} {83227#true} #1216#return; {83227#true} is VALID [2022-04-15 11:35:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:35:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {83227#true} ~cond := #in~cond; {83227#true} is VALID [2022-04-15 11:35:56,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume !(0 == ~cond); {83227#true} is VALID [2022-04-15 11:35:56,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83227#true} {83227#true} #1254#return; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L272 TraceCheckUtils]: 1: Hoare triple {83227#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} ~cond := #in~cond; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume !(0 == ~cond); {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {83227#true} {83227#true} #1254#return; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {83227#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,020 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {83227#true} {83227#true} #1218#return; {83227#true} is VALID [2022-04-15 11:35:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:35:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {83227#true} is VALID [2022-04-15 11:35:56,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~5; {83227#true} is VALID [2022-04-15 11:35:56,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:56,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,098 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83227#true} {83227#true} #1176#return; {83227#true} is VALID [2022-04-15 11:35:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:35:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:35:56,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:35:56,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,198 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {83227#true} #1178#return; {83228#false} is VALID [2022-04-15 11:35:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:35:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {83227#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {83227#true} is VALID [2022-04-15 11:35:56,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~2; {83227#true} is VALID [2022-04-15 11:35:56,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {83227#true} is VALID [2022-04-15 11:35:56,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,206 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83227#true} {83228#false} #1180#return; {83228#false} is VALID [2022-04-15 11:35:56,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,208 INFO L272 TraceCheckUtils]: 1: Hoare triple {83227#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:56,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {83227#true} is VALID [2022-04-15 11:35:56,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~5; {83227#true} is VALID [2022-04-15 11:35:56,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {83227#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:56,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,209 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83227#true} {83227#true} #1176#return; {83227#true} is VALID [2022-04-15 11:35:56,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {83227#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {83227#true} is VALID [2022-04-15 11:35:56,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {83227#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {83227#true} is VALID [2022-04-15 11:35:56,210 INFO L272 TraceCheckUtils]: 9: Hoare triple {83227#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:56,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:35:56,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:35:56,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,214 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {83227#true} #1178#return; {83228#false} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {83228#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {83228#false} is VALID [2022-04-15 11:35:56,215 INFO L272 TraceCheckUtils]: 16: Hoare triple {83228#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {83227#true} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {83227#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {83227#true} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~2; {83227#true} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {83227#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {83227#true} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,215 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {83227#true} {83228#false} #1180#return; {83228#false} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {83228#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {83228#false} is VALID [2022-04-15 11:35:56,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {83228#false} assume true; {83228#false} is VALID [2022-04-15 11:35:56,216 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {83228#false} {83227#true} #1220#return; {83228#false} is VALID [2022-04-15 11:35:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:35:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {83337#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83227#true} {83228#false} #1222#return; {83228#false} is VALID [2022-04-15 11:35:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-15 11:35:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {83227#true} is VALID [2022-04-15 11:35:56,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {83227#true} is VALID [2022-04-15 11:35:56,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {83227#true} is VALID [2022-04-15 11:35:56,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume #res.base == dest.base && #res.offset == dest.offset; {83227#true} is VALID [2022-04-15 11:35:56,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83227#true} {83228#false} #1186#return; {83228#false} is VALID [2022-04-15 11:35:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-15 11:35:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:35:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:35:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {83227#true} is VALID [2022-04-15 11:35:56,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83227#true} {83227#true} #1174#return; {83227#true} is VALID [2022-04-15 11:35:56,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {83227#true} is VALID [2022-04-15 11:35:56,319 INFO L272 TraceCheckUtils]: 1: Hoare triple {83227#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:56,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {83227#true} is VALID [2022-04-15 11:35:56,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,319 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83227#true} {83227#true} #1174#return; {83227#true} is VALID [2022-04-15 11:35:56,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {83227#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {83227#true} is VALID [2022-04-15 11:35:56,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,320 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83227#true} {83227#true} #1210#return; {83227#true} is VALID [2022-04-15 11:35:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:35:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {83354#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:56,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83227#true} {83227#true} #1212#return; {83227#true} is VALID [2022-04-15 11:35:56,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {83338#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:56,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume 0 != ~compRegistered~0; {83227#true} is VALID [2022-04-15 11:35:56,338 INFO L272 TraceCheckUtils]: 2: Hoare triple {83227#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:56,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {83227#true} is VALID [2022-04-15 11:35:56,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {83227#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83227#true} {83227#true} #1174#return; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {83227#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83227#true} {83227#true} #1210#return; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {83227#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:56,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {83227#true} assume -1073741802 == ~compRetStatus~0; {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L272 TraceCheckUtils]: 13: Hoare triple {83227#true} call stubMoreProcessingRequired(); {83354#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {83354#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83227#true} {83227#true} #1212#return; {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {83227#true} assume !(0 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {83227#true} assume !(1 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {83227#true} ~returnVal2~0 := 259; {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {83227#true} assume !(~s~0 == ~NP~0); {83227#true} is VALID [2022-04-15 11:35:56,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {83227#true} assume ~s~0 == ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:56,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {83227#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {83227#true} is VALID [2022-04-15 11:35:56,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {83227#true} #res := ~returnVal2~0; {83227#true} is VALID [2022-04-15 11:35:56,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,341 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {83227#true} {83228#false} #1192#return; {83228#false} is VALID [2022-04-15 11:35:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 11:35:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {83355#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} assume !(~s~0 == ~MPR3~0); {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} assume !(1 == ~customIrp~0); {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {83227#true} assume !(~s~0 == ~MPR3~0); {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~13; {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {83227#true} #res := 0; {83227#true} is VALID [2022-04-15 11:35:56,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,366 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83227#true} {83228#false} #1194#return; {83228#false} is VALID [2022-04-15 11:35:56,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {83227#true} call ULTIMATE.init(); {83311#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:56,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {83311#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83227#true} {83227#true} #1270#return; {83227#true} is VALID [2022-04-15 11:35:56,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {83227#true} call #t~ret213 := main(); {83227#true} is VALID [2022-04-15 11:35:56,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {83227#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {83227#true} is VALID [2022-04-15 11:35:56,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {83227#true} call _BLAST_init(); {83312#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:56,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {83312#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,369 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {83227#true} {83227#true} #1216#return; {83227#true} is VALID [2022-04-15 11:35:56,370 INFO L272 TraceCheckUtils]: 10: Hoare triple {83227#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:56,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {83227#true} is VALID [2022-04-15 11:35:56,370 INFO L272 TraceCheckUtils]: 12: Hoare triple {83227#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {83227#true} is VALID [2022-04-15 11:35:56,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {83227#true} ~cond := #in~cond; {83227#true} is VALID [2022-04-15 11:35:56,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {83227#true} assume !(0 == ~cond); {83227#true} is VALID [2022-04-15 11:35:56,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83227#true} {83227#true} #1254#return; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {83227#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {83227#true} {83227#true} #1218#return; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {83227#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {83227#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {83227#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {83227#true} is VALID [2022-04-15 11:35:56,372 INFO L272 TraceCheckUtils]: 23: Hoare triple {83227#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:56,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L272 TraceCheckUtils]: 25: Hoare triple {83227#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {83318#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~5; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {83227#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {83227#true} {83227#true} #1176#return; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {83227#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {83227#true} is VALID [2022-04-15 11:35:56,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {83227#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {83227#true} is VALID [2022-04-15 11:35:56,375 INFO L272 TraceCheckUtils]: 33: Hoare triple {83227#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:56,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:35:56,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {83334#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:35:56,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {83335#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:35:56,379 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {83336#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {83227#true} #1178#return; {83228#false} is VALID [2022-04-15 11:35:56,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {83228#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {83228#false} is VALID [2022-04-15 11:35:56,380 INFO L272 TraceCheckUtils]: 40: Hoare triple {83228#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {83227#true} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {83227#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {83227#true} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~2; {83227#true} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {83227#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {83227#true} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,380 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {83227#true} {83228#false} #1180#return; {83228#false} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {83228#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {83228#false} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {83228#false} assume true; {83228#false} is VALID [2022-04-15 11:35:56,380 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {83228#false} {83227#true} #1220#return; {83228#false} is VALID [2022-04-15 11:35:56,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {83228#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L272 TraceCheckUtils]: 50: Hoare triple {83228#false} call stub_driver_init(); {83337#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {83337#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,381 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {83227#true} {83228#false} #1222#return; {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {83228#false} assume !!(~status~5 >= 0); {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {83228#false} assume !(0 == ~__BLAST_NONDET~0); {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {83228#false} assume !(1 == ~__BLAST_NONDET~0); {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {83228#false} assume !(2 == ~__BLAST_NONDET~0); {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {83228#false} assume 3 == ~__BLAST_NONDET~0; {83228#false} is VALID [2022-04-15 11:35:56,381 INFO L272 TraceCheckUtils]: 59: Hoare triple {83228#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {83228#false} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {83228#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {83228#false} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {83228#false} assume 0 == #t~mem81 % 256;havoc #t~mem81; {83228#false} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {83228#false} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {83228#false} is VALID [2022-04-15 11:35:56,382 INFO L272 TraceCheckUtils]: 63: Hoare triple {83228#false} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {83313#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {83227#true} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {83227#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {83227#true} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {83227#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {83227#true} is VALID [2022-04-15 11:35:56,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {83227#true} assume #res.base == dest.base && #res.offset == dest.offset; {83227#true} is VALID [2022-04-15 11:35:56,382 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {83227#true} {83228#false} #1186#return; {83228#false} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {83228#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {83228#false} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {83228#false} assume !(~s~0 != ~NP~0); {83228#false} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {83228#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {83228#false} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {83228#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {83228#false} is VALID [2022-04-15 11:35:56,383 INFO L272 TraceCheckUtils]: 73: Hoare triple {83228#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {83338#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {83338#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:56,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {83227#true} assume 0 != ~compRegistered~0; {83227#true} is VALID [2022-04-15 11:35:56,384 INFO L272 TraceCheckUtils]: 76: Hoare triple {83227#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:56,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L272 TraceCheckUtils]: 78: Hoare triple {83227#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:35:56,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {83350#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {83227#true} {83227#true} #1174#return; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {83227#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,385 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {83227#true} {83227#true} #1210#return; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {83227#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {83227#true} assume -1073741802 == ~compRetStatus~0; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L272 TraceCheckUtils]: 87: Hoare triple {83227#true} call stubMoreProcessingRequired(); {83354#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:56,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {83354#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {83227#true} {83227#true} #1212#return; {83227#true} is VALID [2022-04-15 11:35:56,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {83227#true} assume !(0 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {83227#true} assume !(1 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {83227#true} ~returnVal2~0 := 259; {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {83227#true} assume !(~s~0 == ~NP~0); {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {83227#true} assume ~s~0 == ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {83227#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {83227#true} #res := ~returnVal2~0; {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 98: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,387 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {83227#true} {83228#false} #1192#return; {83228#false} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 100: Hoare triple {83228#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {83228#false} is VALID [2022-04-15 11:35:56,387 INFO L290 TraceCheckUtils]: 101: Hoare triple {83228#false} assume 259 == ~status~3; {83228#false} is VALID [2022-04-15 11:35:56,387 INFO L272 TraceCheckUtils]: 102: Hoare triple {83228#false} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {83355#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {83355#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 104: Hoare triple {83227#true} assume !(~s~0 == ~MPR3~0); {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {83227#true} assume !(1 == ~customIrp~0); {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {83227#true} assume !(~s~0 == ~MPR3~0); {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~13; {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 108: Hoare triple {83227#true} #res := 0; {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 109: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:56,388 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {83227#true} {83228#false} #1194#return; {83228#false} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 111: Hoare triple {83228#false} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {83228#false} is VALID [2022-04-15 11:35:56,388 INFO L290 TraceCheckUtils]: 112: Hoare triple {83228#false} assume ~status~3 >= 0; {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L290 TraceCheckUtils]: 113: Hoare triple {83228#false} assume !(~myStatus~0 >= 0); {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {83228#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L272 TraceCheckUtils]: 115: Hoare triple {83228#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {83228#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L290 TraceCheckUtils]: 117: Hoare triple {83228#false} assume !(~s~0 == ~NP~0); {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L272 TraceCheckUtils]: 118: Hoare triple {83228#false} call errorFn(); {83228#false} is VALID [2022-04-15 11:35:56,389 INFO L290 TraceCheckUtils]: 119: Hoare triple {83228#false} assume !false; {83228#false} is VALID [2022-04-15 11:35:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:35:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:56,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25006370] [2022-04-15 11:35:56,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25006370] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:35:56,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824832088] [2022-04-15 11:35:56,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:35:56,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:35:56,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:35:56,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:35:56,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 11:35:57,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:35:57,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:35:57,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:35:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:57,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:35:57,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {83227#true} call ULTIMATE.init(); {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {83227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83227#true} {83227#true} #1270#return; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {83227#true} call #t~ret213 := main(); {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {83227#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {83227#true} call _BLAST_init(); {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {83227#true} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {83227#true} {83227#true} #1216#return; {83227#true} is VALID [2022-04-15 11:35:57,743 INFO L272 TraceCheckUtils]: 10: Hoare triple {83227#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {83227#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L272 TraceCheckUtils]: 12: Hoare triple {83227#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {83227#true} ~cond := #in~cond; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {83227#true} assume !(0 == ~cond); {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83227#true} {83227#true} #1254#return; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {83227#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {83227#true} {83227#true} #1218#return; {83227#true} is VALID [2022-04-15 11:35:57,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {83227#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {83227#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {83227#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L272 TraceCheckUtils]: 23: Hoare triple {83227#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {83227#true} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L272 TraceCheckUtils]: 25: Hoare triple {83227#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {83227#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~5; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {83227#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,745 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {83227#true} {83227#true} #1176#return; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {83227#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {83227#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L272 TraceCheckUtils]: 33: Hoare triple {83227#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {83227#true} #t~loopctr214 := 0; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {83227#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {83227#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {83227#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {83227#true} {83227#true} #1178#return; {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {83227#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L272 TraceCheckUtils]: 40: Hoare triple {83227#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {83227#true} is VALID [2022-04-15 11:35:57,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {83227#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {83227#true} assume 0 == ~__BLAST_NONDET~2; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {83227#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {83227#true} {83227#true} #1180#return; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {83227#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {83227#true} {83227#true} #1220#return; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {83227#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L272 TraceCheckUtils]: 50: Hoare triple {83227#true} call stub_driver_init(); {83227#true} is VALID [2022-04-15 11:35:57,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {83227#true} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {83227#true} {83227#true} #1222#return; {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {83227#true} assume !!(~status~5 >= 0); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {83227#true} assume !(0 == ~__BLAST_NONDET~0); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {83227#true} assume !(1 == ~__BLAST_NONDET~0); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {83227#true} assume !(2 == ~__BLAST_NONDET~0); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {83227#true} assume 3 == ~__BLAST_NONDET~0; {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L272 TraceCheckUtils]: 59: Hoare triple {83227#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {83227#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {83227#true} is VALID [2022-04-15 11:35:57,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {83227#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {83227#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L272 TraceCheckUtils]: 63: Hoare triple {83227#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {83227#true} #t~loopctr215 := 0; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {83227#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {83227#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {83227#true} assume #res.base == dest.base && #res.offset == dest.offset; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {83227#true} {83227#true} #1186#return; {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {83227#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {83227#true} assume !(~s~0 != ~NP~0); {83227#true} is VALID [2022-04-15 11:35:57,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {83227#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {83227#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L272 TraceCheckUtils]: 73: Hoare triple {83227#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {83227#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {83227#true} assume 0 != ~compRegistered~0; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L272 TraceCheckUtils]: 76: Hoare triple {83227#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {83227#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L272 TraceCheckUtils]: 78: Hoare triple {83227#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {83227#true} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {83227#true} {83227#true} #1174#return; {83227#true} is VALID [2022-04-15 11:35:57,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {83227#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {83227#true} {83227#true} #1210#return; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {83227#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 86: Hoare triple {83227#true} assume -1073741802 == ~compRetStatus~0; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L272 TraceCheckUtils]: 87: Hoare triple {83227#true} call stubMoreProcessingRequired(); {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 88: Hoare triple {83227#true} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 89: Hoare triple {83227#true} assume true; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {83227#true} {83227#true} #1212#return; {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 91: Hoare triple {83227#true} assume !(0 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:57,751 INFO L290 TraceCheckUtils]: 92: Hoare triple {83227#true} assume !(1 == ~__BLAST_NONDET~11); {83227#true} is VALID [2022-04-15 11:35:57,752 INFO L290 TraceCheckUtils]: 93: Hoare triple {83227#true} ~returnVal2~0 := 259; {83227#true} is VALID [2022-04-15 11:35:57,752 INFO L290 TraceCheckUtils]: 94: Hoare triple {83227#true} assume !(~s~0 == ~NP~0); {83227#true} is VALID [2022-04-15 11:35:57,752 INFO L290 TraceCheckUtils]: 95: Hoare triple {83227#true} assume ~s~0 == ~MPR1~0; {83227#true} is VALID [2022-04-15 11:35:57,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {83227#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,753 INFO L290 TraceCheckUtils]: 97: Hoare triple {83647#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,753 INFO L290 TraceCheckUtils]: 98: Hoare triple {83647#(= ~MPR3~0 ~s~0)} assume true; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,754 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {83647#(= ~MPR3~0 ~s~0)} {83227#true} #1192#return; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,754 INFO L290 TraceCheckUtils]: 100: Hoare triple {83647#(= ~MPR3~0 ~s~0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,755 INFO L290 TraceCheckUtils]: 101: Hoare triple {83647#(= ~MPR3~0 ~s~0)} assume 259 == ~status~3; {83647#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 11:35:57,756 INFO L272 TraceCheckUtils]: 102: Hoare triple {83647#(= ~MPR3~0 ~s~0)} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {83354#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:57,756 INFO L290 TraceCheckUtils]: 103: Hoare triple {83354#(= ~s~0 |old(~s~0)|)} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {83354#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:57,756 INFO L290 TraceCheckUtils]: 104: Hoare triple {83354#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,757 INFO L290 TraceCheckUtils]: 105: Hoare triple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} assume !(1 == ~customIrp~0); {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,757 INFO L290 TraceCheckUtils]: 106: Hoare triple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} assume !(~s~0 == ~MPR3~0); {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,758 INFO L290 TraceCheckUtils]: 107: Hoare triple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} assume 0 == ~__BLAST_NONDET~13; {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,758 INFO L290 TraceCheckUtils]: 108: Hoare triple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} #res := 0; {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,758 INFO L290 TraceCheckUtils]: 109: Hoare triple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} assume true; {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} is VALID [2022-04-15 11:35:57,759 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {83672#(and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)))} {83647#(= ~MPR3~0 ~s~0)} #1194#return; {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 111: Hoare triple {83228#false} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 112: Hoare triple {83228#false} assume ~status~3 >= 0; {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 113: Hoare triple {83228#false} assume !(~myStatus~0 >= 0); {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 114: Hoare triple {83228#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L272 TraceCheckUtils]: 115: Hoare triple {83228#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 116: Hoare triple {83228#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 117: Hoare triple {83228#false} assume !(~s~0 == ~NP~0); {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L272 TraceCheckUtils]: 118: Hoare triple {83228#false} call errorFn(); {83228#false} is VALID [2022-04-15 11:35:57,760 INFO L290 TraceCheckUtils]: 119: Hoare triple {83228#false} assume !false; {83228#false} is VALID [2022-04-15 11:35:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:35:57,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:35:57,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824832088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:57,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:35:57,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2022-04-15 11:35:57,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:57,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488718565] [2022-04-15 11:35:57,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488718565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:57,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:57,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90528634] [2022-04-15 11:35:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2022-04-15 11:35:57,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:57,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-15 11:35:57,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:57,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:57,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:35:57,850 INFO L87 Difference]: Start difference. First operand 338 states and 377 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-15 11:36:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:05,175 INFO L93 Difference]: Finished difference Result 378 states and 421 transitions. [2022-04-15 11:36:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:36:05,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2022-04-15 11:36:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-15 11:36:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2022-04-15 11:36:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-15 11:36:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2022-04-15 11:36:05,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 212 transitions. [2022-04-15 11:36:05,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:05,346 INFO L225 Difference]: With dead ends: 378 [2022-04-15 11:36:05,346 INFO L226 Difference]: Without dead ends: 313 [2022-04-15 11:36:05,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-15 11:36:05,347 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 71 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:05,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 308 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 11:36:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-15 11:36:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2022-04-15 11:36:06,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:06,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:36:06,086 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:36:06,086 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:36:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:06,101 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2022-04-15 11:36:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 343 transitions. [2022-04-15 11:36:06,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:06,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:06,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) Second operand 313 states. [2022-04-15 11:36:06,101 INFO L87 Difference]: Start difference. First operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) Second operand 313 states. [2022-04-15 11:36:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:06,105 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2022-04-15 11:36:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 343 transitions. [2022-04-15 11:36:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:06,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:06,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 225 states have internal predecessors, (250), 33 states have call successors, (33), 33 states have call predecessors, (33), 34 states have return successors, (35), 32 states have call predecessors, (35), 31 states have call successors, (35) [2022-04-15 11:36:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 318 transitions. [2022-04-15 11:36:06,110 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 318 transitions. Word has length 120 [2022-04-15 11:36:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:06,110 INFO L478 AbstractCegarLoop]: Abstraction has 291 states and 318 transitions. [2022-04-15 11:36:06,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-15 11:36:06,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 291 states and 318 transitions. [2022-04-15 11:36:06,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 318 transitions. [2022-04-15 11:36:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 11:36:06,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:06,941 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:06,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 11:36:07,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 11:36:07,142 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -783486713, now seen corresponding path program 1 times [2022-04-15 11:36:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:07,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864996503] [2022-04-15 11:36:07,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:36:07,151 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:36:07,151 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash -783486713, now seen corresponding path program 2 times [2022-04-15 11:36:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:07,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005563542] [2022-04-15 11:36:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {85783#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85684#true} {85684#true} #1270#return; {85684#true} is VALID [2022-04-15 11:36:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:36:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {85784#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85684#true} {85684#true} #1216#return; {85684#true} is VALID [2022-04-15 11:36:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:36:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#true} ~cond := #in~cond; {85684#true} is VALID [2022-04-15 11:36:07,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume !(0 == ~cond); {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85684#true} {85684#true} #1254#return; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L272 TraceCheckUtils]: 1: Hoare triple {85684#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} ~cond := #in~cond; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume !(0 == ~cond); {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {85684#true} {85684#true} #1254#return; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {85684#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,379 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {85684#true} {85684#true} #1218#return; {85684#true} is VALID [2022-04-15 11:36:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:36:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {85684#true} is VALID [2022-04-15 11:36:07,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~5; {85684#true} is VALID [2022-04-15 11:36:07,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {85684#true} is VALID [2022-04-15 11:36:07,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,446 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {85684#true} {85684#true} #1176#return; {85684#true} is VALID [2022-04-15 11:36:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:36:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {85684#true} is VALID [2022-04-15 11:36:07,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {85684#true} is VALID [2022-04-15 11:36:07,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {85684#true} is VALID [2022-04-15 11:36:07,452 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {85684#true} {85684#true} #1178#return; {85684#true} is VALID [2022-04-15 11:36:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:36:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {85684#true} is VALID [2022-04-15 11:36:07,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~2; {85684#true} is VALID [2022-04-15 11:36:07,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {85684#true} is VALID [2022-04-15 11:36:07,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,457 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {85684#true} {85684#true} #1180#return; {85684#true} is VALID [2022-04-15 11:36:07,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L272 TraceCheckUtils]: 1: Hoare triple {85684#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~5; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {85684#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {85684#true} {85684#true} #1176#return; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {85684#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {85684#true} is VALID [2022-04-15 11:36:07,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {85684#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L272 TraceCheckUtils]: 9: Hoare triple {85684#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {85684#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {85684#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {85684#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {85684#true} {85684#true} #1178#return; {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {85684#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L272 TraceCheckUtils]: 16: Hoare triple {85684#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {85684#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {85684#true} is VALID [2022-04-15 11:36:07,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~2; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {85684#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {85684#true} {85684#true} #1180#return; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {85684#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {85684#true} {85684#true} #1220#return; {85684#true} is VALID [2022-04-15 11:36:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:36:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {85806#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85684#true} {85684#true} #1222#return; {85684#true} is VALID [2022-04-15 11:36:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:36:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:36:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {85684#true} is VALID [2022-04-15 11:36:07,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {85684#true} is VALID [2022-04-15 11:36:07,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume #res.base == dest.base && #res.offset == dest.offset; {85684#true} is VALID [2022-04-15 11:36:07,586 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {85684#true} {85684#true} #1186#return; {85684#true} is VALID [2022-04-15 11:36:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:36:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {85684#true} is VALID [2022-04-15 11:36:07,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85684#true} {85684#true} #1174#return; {85684#true} is VALID [2022-04-15 11:36:07,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {85684#true} is VALID [2022-04-15 11:36:07,668 INFO L272 TraceCheckUtils]: 1: Hoare triple {85684#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {85684#true} is VALID [2022-04-15 11:36:07,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,669 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {85684#true} {85684#true} #1174#return; {85684#true} is VALID [2022-04-15 11:36:07,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {85684#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {85684#true} is VALID [2022-04-15 11:36:07,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,669 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {85684#true} {85684#true} #1210#return; {85684#true} is VALID [2022-04-15 11:36:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {85684#true} is VALID [2022-04-15 11:36:07,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85684#true} {85684#true} #1212#return; {85684#true} is VALID [2022-04-15 11:36:07,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {85845#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume 0 != ~compRegistered~0; {85684#true} is VALID [2022-04-15 11:36:07,687 INFO L272 TraceCheckUtils]: 2: Hoare triple {85684#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {85684#true} is VALID [2022-04-15 11:36:07,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {85684#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {85684#true} {85684#true} #1174#return; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {85684#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85684#true} {85684#true} #1210#return; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {85684#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {85684#true} assume -1073741802 == ~compRetStatus~0; {85684#true} is VALID [2022-04-15 11:36:07,688 INFO L272 TraceCheckUtils]: 13: Hoare triple {85684#true} call stubMoreProcessingRequired(); {85863#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:07,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {85684#true} is VALID [2022-04-15 11:36:07,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,689 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {85684#true} {85684#true} #1212#return; {85684#true} is VALID [2022-04-15 11:36:07,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~11; {85684#true} is VALID [2022-04-15 11:36:07,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {85684#true} ~returnVal2~0 := 0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,692 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {85684#true} #1192#return; {85838#(= |KbFilter_PnP_#t~ret109| 0)} is VALID [2022-04-15 11:36:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:36:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:07,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {85684#true} is VALID [2022-04-15 11:36:07,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {85684#true} is VALID [2022-04-15 11:36:07,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85684#true} {85839#(= KbFilter_PnP_~status~3 0)} #1196#return; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {85807#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {85684#true} is VALID [2022-04-15 11:36:07,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {85684#true} is VALID [2022-04-15 11:36:07,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L272 TraceCheckUtils]: 3: Hoare triple {85684#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {85684#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {85684#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {85684#true} assume #res.base == dest.base && #res.offset == dest.offset; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {85684#true} {85684#true} #1186#return; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {85684#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {85684#true} assume !(~s~0 != ~NP~0); {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {85684#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {85684#true} is VALID [2022-04-15 11:36:07,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {85684#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,700 INFO L272 TraceCheckUtils]: 13: Hoare triple {85684#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {85845#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:07,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {85845#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {85684#true} assume 0 != ~compRegistered~0; {85684#true} is VALID [2022-04-15 11:36:07,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {85684#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L272 TraceCheckUtils]: 18: Hoare triple {85684#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {85684#true} {85684#true} #1174#return; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {85684#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {85684#true} {85684#true} #1210#return; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {85684#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {85684#true} assume -1073741802 == ~compRetStatus~0; {85684#true} is VALID [2022-04-15 11:36:07,703 INFO L272 TraceCheckUtils]: 27: Hoare triple {85684#true} call stubMoreProcessingRequired(); {85863#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:07,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {85684#true} is VALID [2022-04-15 11:36:07,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,703 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {85684#true} {85684#true} #1212#return; {85684#true} is VALID [2022-04-15 11:36:07,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~11; {85684#true} is VALID [2022-04-15 11:36:07,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {85684#true} ~returnVal2~0 := 0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,706 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {85684#true} #1192#return; {85838#(= |KbFilter_PnP_#t~ret109| 0)} is VALID [2022-04-15 11:36:07,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {85838#(= |KbFilter_PnP_#t~ret109| 0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume !(259 == ~status~3); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume ~status~3 >= 0; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,708 INFO L272 TraceCheckUtils]: 44: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {85863#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:07,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {85684#true} is VALID [2022-04-15 11:36:07,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {85684#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {85684#true} is VALID [2022-04-15 11:36:07,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,709 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {85684#true} {85839#(= KbFilter_PnP_~status~3 0)} #1196#return; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {85844#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:36:07,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {85844#(= |KbFilter_PnP_#res| 0)} assume true; {85844#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:36:07,710 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {85844#(= |KbFilter_PnP_#res| 0)} {85684#true} #1230#return; {85781#(not (= 259 |main_#t~ret174|))} is VALID [2022-04-15 11:36:07,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {85684#true} call ULTIMATE.init(); {85783#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:36:07,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {85783#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85684#true} {85684#true} #1270#return; {85684#true} is VALID [2022-04-15 11:36:07,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {85684#true} call #t~ret213 := main(); {85684#true} is VALID [2022-04-15 11:36:07,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {85684#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {85684#true} is VALID [2022-04-15 11:36:07,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {85684#true} call _BLAST_init(); {85784#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:07,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {85784#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,713 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {85684#true} {85684#true} #1216#return; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L272 TraceCheckUtils]: 10: Hoare triple {85684#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L272 TraceCheckUtils]: 12: Hoare triple {85684#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {85684#true} ~cond := #in~cond; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {85684#true} assume !(0 == ~cond); {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {85684#true} {85684#true} #1254#return; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {85684#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,714 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {85684#true} {85684#true} #1218#return; {85684#true} is VALID [2022-04-15 11:36:07,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {85684#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {85684#true} is VALID [2022-04-15 11:36:07,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {85684#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {85684#true} assume !(0 == ~irp_choice~0); {85684#true} is VALID [2022-04-15 11:36:07,716 INFO L272 TraceCheckUtils]: 23: Hoare triple {85684#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:07,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L272 TraceCheckUtils]: 25: Hoare triple {85684#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {85790#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~5; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {85684#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {85684#true} {85684#true} #1176#return; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {85684#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {85684#true} is VALID [2022-04-15 11:36:07,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {85684#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,718 INFO L272 TraceCheckUtils]: 33: Hoare triple {85684#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:07,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {85684#true} is VALID [2022-04-15 11:36:07,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {85684#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {85684#true} is VALID [2022-04-15 11:36:07,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {85684#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {85684#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {85684#true} {85684#true} #1178#return; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {85684#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L272 TraceCheckUtils]: 40: Hoare triple {85684#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {85684#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~2; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {85684#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {85684#true} {85684#true} #1180#return; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {85684#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {85684#true} {85684#true} #1220#return; {85684#true} is VALID [2022-04-15 11:36:07,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {85684#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L272 TraceCheckUtils]: 50: Hoare triple {85684#true} call stub_driver_init(); {85806#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {85806#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {85684#true} {85684#true} #1222#return; {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {85684#true} assume !!(~status~5 >= 0); {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {85684#true} assume !(0 == ~__BLAST_NONDET~0); {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {85684#true} assume !(1 == ~__BLAST_NONDET~0); {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {85684#true} assume !(2 == ~__BLAST_NONDET~0); {85684#true} is VALID [2022-04-15 11:36:07,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {85684#true} assume 3 == ~__BLAST_NONDET~0; {85684#true} is VALID [2022-04-15 11:36:07,722 INFO L272 TraceCheckUtils]: 59: Hoare triple {85684#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {85807#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:07,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {85807#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {85684#true} is VALID [2022-04-15 11:36:07,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {85684#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {85684#true} is VALID [2022-04-15 11:36:07,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {85684#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L272 TraceCheckUtils]: 63: Hoare triple {85684#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {85785#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {85684#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {85684#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {85684#true} assume #res.base == dest.base && #res.offset == dest.offset; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {85684#true} {85684#true} #1186#return; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 69: Hoare triple {85684#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 70: Hoare triple {85684#true} assume !(~s~0 != ~NP~0); {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 71: Hoare triple {85684#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {85684#true} is VALID [2022-04-15 11:36:07,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {85684#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {85684#true} is VALID [2022-04-15 11:36:07,724 INFO L272 TraceCheckUtils]: 73: Hoare triple {85684#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {85845#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:07,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {85845#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,724 INFO L290 TraceCheckUtils]: 75: Hoare triple {85684#true} assume 0 != ~compRegistered~0; {85684#true} is VALID [2022-04-15 11:36:07,725 INFO L272 TraceCheckUtils]: 76: Hoare triple {85684#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L272 TraceCheckUtils]: 78: Hoare triple {85684#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 79: Hoare triple {85859#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 80: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {85684#true} {85684#true} #1174#return; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 82: Hoare triple {85684#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 83: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {85684#true} {85684#true} #1210#return; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {85684#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {85684#true} is VALID [2022-04-15 11:36:07,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {85684#true} assume -1073741802 == ~compRetStatus~0; {85684#true} is VALID [2022-04-15 11:36:07,727 INFO L272 TraceCheckUtils]: 87: Hoare triple {85684#true} call stubMoreProcessingRequired(); {85863#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:07,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {85684#true} is VALID [2022-04-15 11:36:07,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,727 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {85684#true} {85684#true} #1212#return; {85684#true} is VALID [2022-04-15 11:36:07,727 INFO L290 TraceCheckUtils]: 91: Hoare triple {85684#true} assume 0 == ~__BLAST_NONDET~11; {85684#true} is VALID [2022-04-15 11:36:07,727 INFO L290 TraceCheckUtils]: 92: Hoare triple {85684#true} ~returnVal2~0 := 0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,728 INFO L290 TraceCheckUtils]: 94: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,728 INFO L290 TraceCheckUtils]: 95: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 11:36:07,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {85857#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 11:36:07,730 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {85858#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {85684#true} #1192#return; {85838#(= |KbFilter_PnP_#t~ret109| 0)} is VALID [2022-04-15 11:36:07,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {85838#(= |KbFilter_PnP_#t~ret109| 0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,731 INFO L290 TraceCheckUtils]: 100: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume !(259 == ~status~3); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume ~status~3 >= 0; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,732 INFO L272 TraceCheckUtils]: 104: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {85863#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:07,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {85863#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {85684#true} is VALID [2022-04-15 11:36:07,732 INFO L290 TraceCheckUtils]: 106: Hoare triple {85684#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {85684#true} is VALID [2022-04-15 11:36:07,732 INFO L290 TraceCheckUtils]: 107: Hoare triple {85684#true} assume true; {85684#true} is VALID [2022-04-15 11:36:07,733 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {85684#true} {85839#(= KbFilter_PnP_~status~3 0)} #1196#return; {85839#(= KbFilter_PnP_~status~3 0)} is VALID [2022-04-15 11:36:07,733 INFO L290 TraceCheckUtils]: 109: Hoare triple {85839#(= KbFilter_PnP_~status~3 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {85844#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:36:07,733 INFO L290 TraceCheckUtils]: 110: Hoare triple {85844#(= |KbFilter_PnP_#res| 0)} assume true; {85844#(= |KbFilter_PnP_#res| 0)} is VALID [2022-04-15 11:36:07,734 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85844#(= |KbFilter_PnP_#res| 0)} {85684#true} #1230#return; {85781#(not (= 259 |main_#t~ret174|))} is VALID [2022-04-15 11:36:07,734 INFO L290 TraceCheckUtils]: 112: Hoare triple {85781#(not (= 259 |main_#t~ret174|))} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,735 INFO L290 TraceCheckUtils]: 113: Hoare triple {85782#(not (= main_~status~5 259))} assume 0 != ~we_should_unload~0; {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,735 INFO L290 TraceCheckUtils]: 114: Hoare triple {85782#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,735 INFO L290 TraceCheckUtils]: 115: Hoare triple {85782#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {85782#(not (= main_~status~5 259))} assume !(~s~0 == ~UNLOADED~0); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {85782#(not (= main_~status~5 259))} assume !(-1 == ~status~5); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {85782#(not (= main_~status~5 259))} assume ~s~0 != ~SKIP2~0; {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,737 INFO L290 TraceCheckUtils]: 119: Hoare triple {85782#(not (= main_~status~5 259))} assume ~s~0 != ~IPC~0; {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,737 INFO L290 TraceCheckUtils]: 120: Hoare triple {85782#(not (= main_~status~5 259))} assume !(~s~0 != ~DC~0); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {85782#(not (= main_~status~5 259))} assume !(1 == ~pended~0); {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,738 INFO L290 TraceCheckUtils]: 122: Hoare triple {85782#(not (= main_~status~5 259))} assume ~s~0 == ~DC~0; {85782#(not (= main_~status~5 259))} is VALID [2022-04-15 11:36:07,738 INFO L290 TraceCheckUtils]: 123: Hoare triple {85782#(not (= main_~status~5 259))} assume 259 == ~status~5; {85685#false} is VALID [2022-04-15 11:36:07,738 INFO L272 TraceCheckUtils]: 124: Hoare triple {85685#false} call errorFn(); {85685#false} is VALID [2022-04-15 11:36:07,738 INFO L290 TraceCheckUtils]: 125: Hoare triple {85685#false} assume !false; {85685#false} is VALID [2022-04-15 11:36:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:36:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:07,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005563542] [2022-04-15 11:36:07,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005563542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:07,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:07,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 11:36:07,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864996503] [2022-04-15 11:36:07,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864996503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:07,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:07,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 11:36:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425788357] [2022-04-15 11:36:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2022-04-15 11:36:07,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:07,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:07,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:07,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 11:36:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:07,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 11:36:07,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:36:07,848 INFO L87 Difference]: Start difference. First operand 291 states and 318 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:10,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:19,972 INFO L93 Difference]: Finished difference Result 345 states and 383 transitions. [2022-04-15 11:36:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:36:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2022-04-15 11:36:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 216 transitions. [2022-04-15 11:36:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 216 transitions. [2022-04-15 11:36:19,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 216 transitions. [2022-04-15 11:36:20,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:20,218 INFO L225 Difference]: With dead ends: 345 [2022-04-15 11:36:20,218 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 11:36:20,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2022-04-15 11:36:20,219 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 251 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:20,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 633 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1248 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 11:36:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 11:36:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 273. [2022-04-15 11:36:20,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:20,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:20,903 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:20,904 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:20,907 INFO L93 Difference]: Finished difference Result 303 states and 336 transitions. [2022-04-15 11:36:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 336 transitions. [2022-04-15 11:36:20,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:20,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:20,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) Second operand 303 states. [2022-04-15 11:36:20,908 INFO L87 Difference]: Start difference. First operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) Second operand 303 states. [2022-04-15 11:36:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:20,911 INFO L93 Difference]: Finished difference Result 303 states and 336 transitions. [2022-04-15 11:36:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 336 transitions. [2022-04-15 11:36:20,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:20,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:20,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:20,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 207 states have (on average 1.1207729468599035) internal successors, (232), 209 states have internal predecessors, (232), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 298 transitions. [2022-04-15 11:36:20,916 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 298 transitions. Word has length 126 [2022-04-15 11:36:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:20,916 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 298 transitions. [2022-04-15 11:36:20,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:20,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 298 transitions. [2022-04-15 11:36:21,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 298 transitions. [2022-04-15 11:36:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 11:36:21,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:21,815 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:21,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:36:21,815 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1014106643, now seen corresponding path program 1 times [2022-04-15 11:36:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:21,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854845529] [2022-04-15 11:36:21,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:36:21,819 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:36:21,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1014106643, now seen corresponding path program 2 times [2022-04-15 11:36:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743503164] [2022-04-15 11:36:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:21,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {87831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87732#true} {87732#true} #1270#return; {87732#true} is VALID [2022-04-15 11:36:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:36:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {87832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87732#true} {87732#true} #1216#return; {87732#true} is VALID [2022-04-15 11:36:22,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:36:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {87732#true} ~cond := #in~cond; {87732#true} is VALID [2022-04-15 11:36:22,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume !(0 == ~cond); {87732#true} is VALID [2022-04-15 11:36:22,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87732#true} {87732#true} #1254#return; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L272 TraceCheckUtils]: 1: Hoare triple {87732#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} ~cond := #in~cond; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume !(0 == ~cond); {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {87732#true} {87732#true} #1254#return; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {87732#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,074 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {87732#true} {87732#true} #1218#return; {87732#true} is VALID [2022-04-15 11:36:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:36:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {87732#true} is VALID [2022-04-15 11:36:22,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~5; {87732#true} is VALID [2022-04-15 11:36:22,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {87732#true} is VALID [2022-04-15 11:36:22,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,113 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87732#true} {87732#true} #1176#return; {87732#true} is VALID [2022-04-15 11:36:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:36:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {87732#true} is VALID [2022-04-15 11:36:22,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {87732#true} is VALID [2022-04-15 11:36:22,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {87732#true} is VALID [2022-04-15 11:36:22,120 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87732#true} {87732#true} #1178#return; {87732#true} is VALID [2022-04-15 11:36:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:36:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {87732#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {87732#true} is VALID [2022-04-15 11:36:22,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~2; {87732#true} is VALID [2022-04-15 11:36:22,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {87732#true} is VALID [2022-04-15 11:36:22,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,125 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87732#true} {87732#true} #1180#return; {87732#true} is VALID [2022-04-15 11:36:22,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L272 TraceCheckUtils]: 1: Hoare triple {87732#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~5; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {87732#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {87732#true} {87732#true} #1176#return; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {87732#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {87732#true} is VALID [2022-04-15 11:36:22,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {87732#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L272 TraceCheckUtils]: 9: Hoare triple {87732#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:22,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {87732#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {87732#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {87732#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {87732#true} {87732#true} #1178#return; {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {87732#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,134 INFO L272 TraceCheckUtils]: 16: Hoare triple {87732#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {87732#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~2; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {87732#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87732#true} {87732#true} #1180#return; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {87732#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,135 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {87732#true} {87732#true} #1220#return; {87732#true} is VALID [2022-04-15 11:36:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:36:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {87854#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87732#true} {87732#true} #1222#return; {87732#true} is VALID [2022-04-15 11:36:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:36:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:36:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {87732#true} is VALID [2022-04-15 11:36:22,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {87732#true} is VALID [2022-04-15 11:36:22,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume #res.base == dest.base && #res.offset == dest.offset; {87732#true} is VALID [2022-04-15 11:36:22,241 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87732#true} {87732#true} #1186#return; {87732#true} is VALID [2022-04-15 11:36:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:36:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {87732#true} is VALID [2022-04-15 11:36:22,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87732#true} {87732#true} #1174#return; {87732#true} is VALID [2022-04-15 11:36:22,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {87732#true} is VALID [2022-04-15 11:36:22,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {87732#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {87732#true} is VALID [2022-04-15 11:36:22,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,292 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87732#true} {87732#true} #1174#return; {87732#true} is VALID [2022-04-15 11:36:22,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {87732#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {87732#true} is VALID [2022-04-15 11:36:22,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,292 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {87732#true} {87732#true} #1210#return; {87732#true} is VALID [2022-04-15 11:36:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87732#true} {87732#true} #1212#return; {87732#true} is VALID [2022-04-15 11:36:22,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {87893#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume 0 != ~compRegistered~0; {87732#true} is VALID [2022-04-15 11:36:22,311 INFO L272 TraceCheckUtils]: 2: Hoare triple {87732#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {87732#true} is VALID [2022-04-15 11:36:22,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {87732#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {87732#true} is VALID [2022-04-15 11:36:22,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {87732#true} {87732#true} #1174#return; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {87732#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {87732#true} {87732#true} #1210#return; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {87732#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {87732#true} assume -1073741802 == ~compRetStatus~0; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {87732#true} call stubMoreProcessingRequired(); {87909#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,312 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87732#true} {87732#true} #1212#return; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {87732#true} assume !(0 == ~__BLAST_NONDET~11); {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {87732#true} assume 1 == ~__BLAST_NONDET~11; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {87732#true} ~returnVal2~0 := -1073741823; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {87732#true} assume !(~s~0 == ~NP~0); {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {87732#true} assume ~s~0 == ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {87732#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {87732#true} #res := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {87732#true} {87732#true} #1192#return; {87732#true} is VALID [2022-04-15 11:36:22,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:36:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:22,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {87732#true} is VALID [2022-04-15 11:36:22,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {87732#true} is VALID [2022-04-15 11:36:22,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87732#true} {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} #1196#return; {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {87855#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {87732#true} is VALID [2022-04-15 11:36:22,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {87732#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {87732#true} is VALID [2022-04-15 11:36:22,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {87732#true} is VALID [2022-04-15 11:36:22,321 INFO L272 TraceCheckUtils]: 3: Hoare triple {87732#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:22,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {87732#true} is VALID [2022-04-15 11:36:22,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {87732#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {87732#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {87732#true} assume #res.base == dest.base && #res.offset == dest.offset; {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {87732#true} {87732#true} #1186#return; {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {87732#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {87732#true} assume !(~s~0 != ~NP~0); {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {87732#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {87732#true} is VALID [2022-04-15 11:36:22,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {87732#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,323 INFO L272 TraceCheckUtils]: 13: Hoare triple {87732#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {87893#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:22,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {87893#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {87732#true} assume 0 != ~compRegistered~0; {87732#true} is VALID [2022-04-15 11:36:22,324 INFO L272 TraceCheckUtils]: 16: Hoare triple {87732#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L272 TraceCheckUtils]: 18: Hoare triple {87732#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87732#true} {87732#true} #1174#return; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {87732#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {87732#true} {87732#true} #1210#return; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {87732#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {87732#true} assume -1073741802 == ~compRetStatus~0; {87732#true} is VALID [2022-04-15 11:36:22,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {87732#true} call stubMoreProcessingRequired(); {87909#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {87732#true} {87732#true} #1212#return; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {87732#true} assume !(0 == ~__BLAST_NONDET~11); {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {87732#true} assume 1 == ~__BLAST_NONDET~11; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {87732#true} ~returnVal2~0 := -1073741823; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {87732#true} assume !(~s~0 == ~NP~0); {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {87732#true} assume ~s~0 == ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {87732#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {87732#true} #res := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {87732#true} {87732#true} #1192#return; {87732#true} is VALID [2022-04-15 11:36:22,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {87732#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {87732#true} is VALID [2022-04-15 11:36:22,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {87732#true} assume !(259 == ~status~3); {87732#true} is VALID [2022-04-15 11:36:22,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {87732#true} assume !(~status~3 >= 0); {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,328 INFO L272 TraceCheckUtils]: 44: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {87909#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:22,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {87732#true} is VALID [2022-04-15 11:36:22,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {87732#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {87732#true} is VALID [2022-04-15 11:36:22,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,329 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {87732#true} {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} #1196#return; {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} is VALID [2022-04-15 11:36:22,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} assume true; {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} is VALID [2022-04-15 11:36:22,331 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} {87732#true} #1230#return; {87829#(<= (+ 1 |main_#t~ret174|) 0)} is VALID [2022-04-15 11:36:22,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {87732#true} call ULTIMATE.init(); {87831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:36:22,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {87831#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87732#true} {87732#true} #1270#return; {87732#true} is VALID [2022-04-15 11:36:22,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {87732#true} call #t~ret213 := main(); {87732#true} is VALID [2022-04-15 11:36:22,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {87732#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {87732#true} is VALID [2022-04-15 11:36:22,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {87732#true} call _BLAST_init(); {87832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:22,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {87832#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,335 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87732#true} {87732#true} #1216#return; {87732#true} is VALID [2022-04-15 11:36:22,335 INFO L272 TraceCheckUtils]: 10: Hoare triple {87732#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L272 TraceCheckUtils]: 12: Hoare triple {87732#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {87732#true} ~cond := #in~cond; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {87732#true} assume !(0 == ~cond); {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87732#true} {87732#true} #1254#return; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {87732#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {87732#true} {87732#true} #1218#return; {87732#true} is VALID [2022-04-15 11:36:22,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {87732#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {87732#true} is VALID [2022-04-15 11:36:22,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {87732#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {87732#true} assume !(0 == ~irp_choice~0); {87732#true} is VALID [2022-04-15 11:36:22,338 INFO L272 TraceCheckUtils]: 23: Hoare triple {87732#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:22,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,339 INFO L272 TraceCheckUtils]: 25: Hoare triple {87732#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:22,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {87838#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {87732#true} is VALID [2022-04-15 11:36:22,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~5; {87732#true} is VALID [2022-04-15 11:36:22,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {87732#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {87732#true} is VALID [2022-04-15 11:36:22,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,340 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {87732#true} {87732#true} #1176#return; {87732#true} is VALID [2022-04-15 11:36:22,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {87732#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {87732#true} is VALID [2022-04-15 11:36:22,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {87732#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L272 TraceCheckUtils]: 33: Hoare triple {87732#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {87732#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {87732#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {87732#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {87732#true} {87732#true} #1178#return; {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {87732#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L272 TraceCheckUtils]: 40: Hoare triple {87732#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {87732#true} is VALID [2022-04-15 11:36:22,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {87732#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {87732#true} assume 0 == ~__BLAST_NONDET~2; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {87732#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {87732#true} {87732#true} #1180#return; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {87732#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {87732#true} {87732#true} #1220#return; {87732#true} is VALID [2022-04-15 11:36:22,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {87732#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {87732#true} is VALID [2022-04-15 11:36:22,343 INFO L272 TraceCheckUtils]: 50: Hoare triple {87732#true} call stub_driver_init(); {87854#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:22,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {87854#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87732#true} is VALID [2022-04-15 11:36:22,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,343 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {87732#true} {87732#true} #1222#return; {87732#true} is VALID [2022-04-15 11:36:22,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {87732#true} assume !!(~status~5 >= 0); {87732#true} is VALID [2022-04-15 11:36:22,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {87732#true} assume !(0 == ~__BLAST_NONDET~0); {87732#true} is VALID [2022-04-15 11:36:22,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {87732#true} assume !(1 == ~__BLAST_NONDET~0); {87732#true} is VALID [2022-04-15 11:36:22,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {87732#true} assume !(2 == ~__BLAST_NONDET~0); {87732#true} is VALID [2022-04-15 11:36:22,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {87732#true} assume 3 == ~__BLAST_NONDET~0; {87732#true} is VALID [2022-04-15 11:36:22,345 INFO L272 TraceCheckUtils]: 59: Hoare triple {87732#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87855#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:22,345 INFO L290 TraceCheckUtils]: 60: Hoare triple {87855#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {87732#true} is VALID [2022-04-15 11:36:22,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {87732#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {87732#true} is VALID [2022-04-15 11:36:22,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {87732#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L272 TraceCheckUtils]: 63: Hoare triple {87732#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 64: Hoare triple {87833#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {87732#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {87732#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {87732#true} assume #res.base == dest.base && #res.offset == dest.offset; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {87732#true} {87732#true} #1186#return; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {87732#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {87732#true} assume !(~s~0 != ~NP~0); {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {87732#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {87732#true} is VALID [2022-04-15 11:36:22,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {87732#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {87732#true} is VALID [2022-04-15 11:36:22,348 INFO L272 TraceCheckUtils]: 73: Hoare triple {87732#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {87893#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:22,349 INFO L290 TraceCheckUtils]: 74: Hoare triple {87893#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {87732#true} assume 0 != ~compRegistered~0; {87732#true} is VALID [2022-04-15 11:36:22,350 INFO L272 TraceCheckUtils]: 76: Hoare triple {87732#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {87732#true} is VALID [2022-04-15 11:36:22,350 INFO L272 TraceCheckUtils]: 78: Hoare triple {87732#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 79: Hoare triple {87905#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {87732#true} {87732#true} #1174#return; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 82: Hoare triple {87732#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 83: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {87732#true} {87732#true} #1210#return; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {87732#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {87732#true} is VALID [2022-04-15 11:36:22,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {87732#true} assume -1073741802 == ~compRetStatus~0; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L272 TraceCheckUtils]: 87: Hoare triple {87732#true} call stubMoreProcessingRequired(); {87909#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {87732#true} {87732#true} #1212#return; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 91: Hoare triple {87732#true} assume !(0 == ~__BLAST_NONDET~11); {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 92: Hoare triple {87732#true} assume 1 == ~__BLAST_NONDET~11; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 93: Hoare triple {87732#true} ~returnVal2~0 := -1073741823; {87732#true} is VALID [2022-04-15 11:36:22,352 INFO L290 TraceCheckUtils]: 94: Hoare triple {87732#true} assume !(~s~0 == ~NP~0); {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {87732#true} assume ~s~0 == ~MPR1~0; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 96: Hoare triple {87732#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 97: Hoare triple {87732#true} #res := ~returnVal2~0; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {87732#true} {87732#true} #1192#return; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {87732#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {87732#true} is VALID [2022-04-15 11:36:22,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {87732#true} assume !(259 == ~status~3); {87732#true} is VALID [2022-04-15 11:36:22,354 INFO L290 TraceCheckUtils]: 102: Hoare triple {87732#true} assume !(~status~3 >= 0); {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,354 INFO L290 TraceCheckUtils]: 103: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,355 INFO L272 TraceCheckUtils]: 104: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {87909#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:22,355 INFO L290 TraceCheckUtils]: 105: Hoare triple {87909#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {87732#true} is VALID [2022-04-15 11:36:22,355 INFO L290 TraceCheckUtils]: 106: Hoare triple {87732#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {87732#true} is VALID [2022-04-15 11:36:22,355 INFO L290 TraceCheckUtils]: 107: Hoare triple {87732#true} assume true; {87732#true} is VALID [2022-04-15 11:36:22,356 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {87732#true} {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} #1196#return; {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} is VALID [2022-04-15 11:36:22,356 INFO L290 TraceCheckUtils]: 109: Hoare triple {87887#(<= (+ KbFilter_PnP_~status~3 1) 0)} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} is VALID [2022-04-15 11:36:22,356 INFO L290 TraceCheckUtils]: 110: Hoare triple {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} assume true; {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} is VALID [2022-04-15 11:36:22,357 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {87892#(<= (+ |KbFilter_PnP_#res| 1) 0)} {87732#true} #1230#return; {87829#(<= (+ 1 |main_#t~ret174|) 0)} is VALID [2022-04-15 11:36:22,358 INFO L290 TraceCheckUtils]: 112: Hoare triple {87829#(<= (+ 1 |main_#t~ret174|) 0)} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,358 INFO L290 TraceCheckUtils]: 113: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume 0 != ~we_should_unload~0; {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,358 INFO L290 TraceCheckUtils]: 114: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(1 == ~pended~0); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,359 INFO L290 TraceCheckUtils]: 115: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(1 == ~pended~0); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,359 INFO L290 TraceCheckUtils]: 116: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(~s~0 == ~UNLOADED~0); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,359 INFO L290 TraceCheckUtils]: 117: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(-1 == ~status~5); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,360 INFO L290 TraceCheckUtils]: 118: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume ~s~0 != ~SKIP2~0; {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,360 INFO L290 TraceCheckUtils]: 119: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume ~s~0 != ~IPC~0; {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,360 INFO L290 TraceCheckUtils]: 120: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(~s~0 != ~DC~0); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,361 INFO L290 TraceCheckUtils]: 121: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume !(1 == ~pended~0); {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,361 INFO L290 TraceCheckUtils]: 122: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume ~s~0 == ~DC~0; {87830#(<= (+ main_~status~5 1) 0)} is VALID [2022-04-15 11:36:22,361 INFO L290 TraceCheckUtils]: 123: Hoare triple {87830#(<= (+ main_~status~5 1) 0)} assume 259 == ~status~5; {87733#false} is VALID [2022-04-15 11:36:22,361 INFO L272 TraceCheckUtils]: 124: Hoare triple {87733#false} call errorFn(); {87733#false} is VALID [2022-04-15 11:36:22,361 INFO L290 TraceCheckUtils]: 125: Hoare triple {87733#false} assume !false; {87733#false} is VALID [2022-04-15 11:36:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:36:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743503164] [2022-04-15 11:36:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743503164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:36:22,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854845529] [2022-04-15 11:36:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854845529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:36:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653293316] [2022-04-15 11:36:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2022-04-15 11:36:22,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:22,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:22,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:22,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:36:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:36:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:36:22,458 INFO L87 Difference]: Start difference. First operand 273 states and 298 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:24,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:31,723 INFO L93 Difference]: Finished difference Result 323 states and 358 transitions. [2022-04-15 11:36:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:36:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2022-04-15 11:36:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2022-04-15 11:36:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2022-04-15 11:36:31,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 203 transitions. [2022-04-15 11:36:31,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:31,973 INFO L225 Difference]: With dead ends: 323 [2022-04-15 11:36:31,973 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 11:36:31,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:36:31,974 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 225 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:31,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 549 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 808 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:36:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 11:36:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 271. [2022-04-15 11:36:32,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:32,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:32,677 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:32,677 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:32,681 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2022-04-15 11:36:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 334 transitions. [2022-04-15 11:36:32,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:32,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:32,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) Second operand 303 states. [2022-04-15 11:36:32,681 INFO L87 Difference]: Start difference. First operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) Second operand 303 states. [2022-04-15 11:36:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:32,685 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2022-04-15 11:36:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 334 transitions. [2022-04-15 11:36:32,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:32,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:32,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:32,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 207 states have internal predecessors, (228), 33 states have call successors, (33), 33 states have call predecessors, (33), 32 states have return successors, (33), 30 states have call predecessors, (33), 31 states have call successors, (33) [2022-04-15 11:36:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 294 transitions. [2022-04-15 11:36:32,689 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 294 transitions. Word has length 126 [2022-04-15 11:36:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:32,689 INFO L478 AbstractCegarLoop]: Abstraction has 271 states and 294 transitions. [2022-04-15 11:36:32,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 11 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:32,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 271 states and 294 transitions. [2022-04-15 11:36:33,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 294 transitions. [2022-04-15 11:36:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 11:36:33,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:33,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:33,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:36:33,520 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash -94633934, now seen corresponding path program 1 times [2022-04-15 11:36:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:33,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706961187] [2022-04-15 11:36:33,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:36:33,522 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:36:33,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -94633934, now seen corresponding path program 2 times [2022-04-15 11:36:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:33,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569424923] [2022-04-15 11:36:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {89816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {89718#true} is VALID [2022-04-15 11:36:33,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89718#true} {89718#true} #1270#return; {89718#true} is VALID [2022-04-15 11:36:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:36:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {89817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {89718#true} is VALID [2022-04-15 11:36:33,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89718#true} {89718#true} #1216#return; {89718#true} is VALID [2022-04-15 11:36:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:36:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {89718#true} ~cond := #in~cond; {89718#true} is VALID [2022-04-15 11:36:33,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume !(0 == ~cond); {89718#true} is VALID [2022-04-15 11:36:33,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89718#true} {89718#true} #1254#return; {89718#true} is VALID [2022-04-15 11:36:33,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {89718#true} is VALID [2022-04-15 11:36:33,738 INFO L272 TraceCheckUtils]: 1: Hoare triple {89718#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} ~cond := #in~cond; {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume !(0 == ~cond); {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {89718#true} {89718#true} #1254#return; {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {89718#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,739 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {89718#true} {89718#true} #1218#return; {89718#true} is VALID [2022-04-15 11:36:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:36:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {89718#true} is VALID [2022-04-15 11:36:33,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~5; {89718#true} is VALID [2022-04-15 11:36:33,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {89718#true} is VALID [2022-04-15 11:36:33,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,777 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89718#true} {89718#true} #1176#return; {89718#true} is VALID [2022-04-15 11:36:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:36:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {89718#true} is VALID [2022-04-15 11:36:33,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {89718#true} is VALID [2022-04-15 11:36:33,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {89718#true} is VALID [2022-04-15 11:36:33,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {89718#true} is VALID [2022-04-15 11:36:33,783 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89718#true} {89718#true} #1178#return; {89718#true} is VALID [2022-04-15 11:36:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:36:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {89718#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {89718#true} is VALID [2022-04-15 11:36:33,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~2; {89718#true} is VALID [2022-04-15 11:36:33,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {89718#true} is VALID [2022-04-15 11:36:33,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,810 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89718#true} {89718#true} #1180#return; {89718#true} is VALID [2022-04-15 11:36:33,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {89718#true} is VALID [2022-04-15 11:36:33,814 INFO L272 TraceCheckUtils]: 1: Hoare triple {89718#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:33,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {89718#true} is VALID [2022-04-15 11:36:33,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~5; {89718#true} is VALID [2022-04-15 11:36:33,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {89718#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {89718#true} is VALID [2022-04-15 11:36:33,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,815 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {89718#true} {89718#true} #1176#return; {89718#true} is VALID [2022-04-15 11:36:33,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {89718#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {89718#true} is VALID [2022-04-15 11:36:33,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {89718#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L272 TraceCheckUtils]: 9: Hoare triple {89718#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {89718#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {89718#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {89718#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {89718#true} {89718#true} #1178#return; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {89718#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L272 TraceCheckUtils]: 16: Hoare triple {89718#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {89718#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~2; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {89718#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {89718#true} is VALID [2022-04-15 11:36:33,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,817 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {89718#true} {89718#true} #1180#return; {89718#true} is VALID [2022-04-15 11:36:33,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {89718#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {89718#true} is VALID [2022-04-15 11:36:33,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,817 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {89718#true} {89718#true} #1220#return; {89718#true} is VALID [2022-04-15 11:36:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:36:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {89839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {89718#true} is VALID [2022-04-15 11:36:33,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89718#true} {89718#true} #1222#return; {89718#true} is VALID [2022-04-15 11:36:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:36:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:36:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {89718#true} is VALID [2022-04-15 11:36:33,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {89718#true} is VALID [2022-04-15 11:36:33,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {89718#true} is VALID [2022-04-15 11:36:33,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume #res.base == dest.base && #res.offset == dest.offset; {89718#true} is VALID [2022-04-15 11:36:33,904 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89718#true} {89718#true} #1186#return; {89718#true} is VALID [2022-04-15 11:36:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:36:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {89718#true} is VALID [2022-04-15 11:36:33,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89718#true} {89718#true} #1174#return; {89718#true} is VALID [2022-04-15 11:36:33,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {89718#true} is VALID [2022-04-15 11:36:33,966 INFO L272 TraceCheckUtils]: 1: Hoare triple {89718#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:33,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {89718#true} is VALID [2022-04-15 11:36:33,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,966 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89718#true} {89718#true} #1174#return; {89718#true} is VALID [2022-04-15 11:36:33,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {89718#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {89718#true} is VALID [2022-04-15 11:36:33,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,967 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89718#true} {89718#true} #1210#return; {89718#true} is VALID [2022-04-15 11:36:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:33,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {89718#true} is VALID [2022-04-15 11:36:33,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89718#true} {89718#true} #1212#return; {89718#true} is VALID [2022-04-15 11:36:33,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {89878#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:33,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume 0 != ~compRegistered~0; {89718#true} is VALID [2022-04-15 11:36:33,983 INFO L272 TraceCheckUtils]: 2: Hoare triple {89718#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:33,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {89718#true} is VALID [2022-04-15 11:36:33,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {89718#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {89718#true} {89718#true} #1174#return; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {89718#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89718#true} {89718#true} #1210#return; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {89718#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {89718#true} assume -1073741802 == ~compRetStatus~0; {89718#true} is VALID [2022-04-15 11:36:33,984 INFO L272 TraceCheckUtils]: 13: Hoare triple {89718#true} call stubMoreProcessingRequired(); {89896#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:33,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {89718#true} is VALID [2022-04-15 11:36:33,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:33,985 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {89718#true} {89718#true} #1212#return; {89718#true} is VALID [2022-04-15 11:36:33,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {89718#true} assume !(0 == ~__BLAST_NONDET~11); {89718#true} is VALID [2022-04-15 11:36:33,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {89718#true} assume 1 == ~__BLAST_NONDET~11; {89718#true} is VALID [2022-04-15 11:36:33,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {89718#true} ~returnVal2~0 := -1073741823; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:33,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:33,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:33,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:33,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} #res := ~returnVal2~0; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:33,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} assume true; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:33,988 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} {89718#true} #1192#return; {89872#(<= (+ 1073741823 |KbFilter_PnP_#t~ret109|) 0)} is VALID [2022-04-15 11:36:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-15 11:36:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:34,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {89718#true} is VALID [2022-04-15 11:36:34,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {89718#true} is VALID [2022-04-15 11:36:34,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89718#true} {89719#false} #1196#return; {89719#false} is VALID [2022-04-15 11:36:34,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {89840#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {89718#true} is VALID [2022-04-15 11:36:34,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {89718#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {89718#true} is VALID [2022-04-15 11:36:34,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {89718#true} is VALID [2022-04-15 11:36:34,008 INFO L272 TraceCheckUtils]: 3: Hoare triple {89718#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {89718#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {89718#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {89718#true} assume #res.base == dest.base && #res.offset == dest.offset; {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {89718#true} {89718#true} #1186#return; {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {89718#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {89718#true} assume !(~s~0 != ~NP~0); {89718#true} is VALID [2022-04-15 11:36:34,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {89718#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {89718#true} is VALID [2022-04-15 11:36:34,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {89718#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {89718#true} is VALID [2022-04-15 11:36:34,011 INFO L272 TraceCheckUtils]: 13: Hoare triple {89718#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {89878#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:34,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {89878#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:34,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {89718#true} assume 0 != ~compRegistered~0; {89718#true} is VALID [2022-04-15 11:36:34,012 INFO L272 TraceCheckUtils]: 16: Hoare triple {89718#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:34,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L272 TraceCheckUtils]: 18: Hoare triple {89718#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:34,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {89718#true} {89718#true} #1174#return; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {89718#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,013 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {89718#true} {89718#true} #1210#return; {89718#true} is VALID [2022-04-15 11:36:34,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {89718#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:34,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {89718#true} assume -1073741802 == ~compRetStatus~0; {89718#true} is VALID [2022-04-15 11:36:34,014 INFO L272 TraceCheckUtils]: 27: Hoare triple {89718#true} call stubMoreProcessingRequired(); {89896#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:34,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {89718#true} is VALID [2022-04-15 11:36:34,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,014 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {89718#true} {89718#true} #1212#return; {89718#true} is VALID [2022-04-15 11:36:34,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {89718#true} assume !(0 == ~__BLAST_NONDET~11); {89718#true} is VALID [2022-04-15 11:36:34,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {89718#true} assume 1 == ~__BLAST_NONDET~11; {89718#true} is VALID [2022-04-15 11:36:34,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {89718#true} ~returnVal2~0 := -1073741823; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} #res := ~returnVal2~0; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:34,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} assume true; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:34,018 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} {89718#true} #1192#return; {89872#(<= (+ 1073741823 |KbFilter_PnP_#t~ret109|) 0)} is VALID [2022-04-15 11:36:34,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {89872#(<= (+ 1073741823 |KbFilter_PnP_#t~ret109|) 0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} is VALID [2022-04-15 11:36:34,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} assume !(259 == ~status~3); {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} is VALID [2022-04-15 11:36:34,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} assume ~status~3 >= 0; {89719#false} is VALID [2022-04-15 11:36:34,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {89719#false} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {89719#false} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {89719#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {89719#false} is VALID [2022-04-15 11:36:34,020 INFO L272 TraceCheckUtils]: 45: Hoare triple {89719#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {89896#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {89718#true} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {89718#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {89718#true} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,020 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {89718#true} {89719#false} #1196#return; {89719#false} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {89719#false} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {89719#false} is VALID [2022-04-15 11:36:34,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {89719#false} assume true; {89719#false} is VALID [2022-04-15 11:36:34,021 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {89719#false} {89718#true} #1230#return; {89719#false} is VALID [2022-04-15 11:36:34,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {89718#true} call ULTIMATE.init(); {89816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:36:34,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {89816#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {89718#true} is VALID [2022-04-15 11:36:34,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89718#true} {89718#true} #1270#return; {89718#true} is VALID [2022-04-15 11:36:34,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {89718#true} call #t~ret213 := main(); {89718#true} is VALID [2022-04-15 11:36:34,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {89718#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {89718#true} is VALID [2022-04-15 11:36:34,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {89718#true} call _BLAST_init(); {89817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:34,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {89817#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {89718#true} is VALID [2022-04-15 11:36:34,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,024 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {89718#true} {89718#true} #1216#return; {89718#true} is VALID [2022-04-15 11:36:34,025 INFO L272 TraceCheckUtils]: 10: Hoare triple {89718#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:34,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {89718#true} is VALID [2022-04-15 11:36:34,025 INFO L272 TraceCheckUtils]: 12: Hoare triple {89718#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {89718#true} is VALID [2022-04-15 11:36:34,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {89718#true} ~cond := #in~cond; {89718#true} is VALID [2022-04-15 11:36:34,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {89718#true} assume !(0 == ~cond); {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {89718#true} {89718#true} #1254#return; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {89718#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {89718#true} {89718#true} #1218#return; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {89718#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {89718#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {89718#true} is VALID [2022-04-15 11:36:34,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {89718#true} assume !(0 == ~irp_choice~0); {89718#true} is VALID [2022-04-15 11:36:34,027 INFO L272 TraceCheckUtils]: 23: Hoare triple {89718#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:34,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L272 TraceCheckUtils]: 25: Hoare triple {89718#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {89823#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~5; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {89718#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {89718#true} {89718#true} #1176#return; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {89718#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {89718#true} is VALID [2022-04-15 11:36:34,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {89718#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {89718#true} is VALID [2022-04-15 11:36:34,030 INFO L272 TraceCheckUtils]: 33: Hoare triple {89718#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:34,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {89718#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {89718#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {89718#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {89718#true} {89718#true} #1178#return; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {89718#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L272 TraceCheckUtils]: 40: Hoare triple {89718#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {89718#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {89718#true} assume 0 == ~__BLAST_NONDET~2; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {89718#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {89718#true} is VALID [2022-04-15 11:36:34,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,032 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {89718#true} {89718#true} #1180#return; {89718#true} is VALID [2022-04-15 11:36:34,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {89718#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {89718#true} is VALID [2022-04-15 11:36:34,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,032 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {89718#true} {89718#true} #1220#return; {89718#true} is VALID [2022-04-15 11:36:34,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {89718#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L272 TraceCheckUtils]: 50: Hoare triple {89718#true} call stub_driver_init(); {89839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {89839#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {89718#true} {89718#true} #1222#return; {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {89718#true} assume !!(~status~5 >= 0); {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {89718#true} assume !(0 == ~__BLAST_NONDET~0); {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {89718#true} assume !(1 == ~__BLAST_NONDET~0); {89718#true} is VALID [2022-04-15 11:36:34,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {89718#true} assume !(2 == ~__BLAST_NONDET~0); {89718#true} is VALID [2022-04-15 11:36:34,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {89718#true} assume 3 == ~__BLAST_NONDET~0; {89718#true} is VALID [2022-04-15 11:36:34,035 INFO L272 TraceCheckUtils]: 59: Hoare triple {89718#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {89840#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:34,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {89840#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {89718#true} is VALID [2022-04-15 11:36:34,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {89718#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {89718#true} is VALID [2022-04-15 11:36:34,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {89718#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {89718#true} is VALID [2022-04-15 11:36:34,036 INFO L272 TraceCheckUtils]: 63: Hoare triple {89718#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {89818#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {89718#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {89718#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {89718#true} assume #res.base == dest.base && #res.offset == dest.offset; {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {89718#true} {89718#true} #1186#return; {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {89718#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {89718#true} assume !(~s~0 != ~NP~0); {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {89718#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {89718#true} is VALID [2022-04-15 11:36:34,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {89718#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {89718#true} is VALID [2022-04-15 11:36:34,038 INFO L272 TraceCheckUtils]: 73: Hoare triple {89718#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {89878#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:34,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {89878#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:34,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {89718#true} assume 0 != ~compRegistered~0; {89718#true} is VALID [2022-04-15 11:36:34,039 INFO L272 TraceCheckUtils]: 76: Hoare triple {89718#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:34,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {89718#true} is VALID [2022-04-15 11:36:34,040 INFO L272 TraceCheckUtils]: 78: Hoare triple {89718#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:34,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {89892#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {89718#true} is VALID [2022-04-15 11:36:34,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {89718#true} {89718#true} #1174#return; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {89718#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {89718#true} {89718#true} #1210#return; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {89718#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {89718#true} assume -1073741802 == ~compRetStatus~0; {89718#true} is VALID [2022-04-15 11:36:34,041 INFO L272 TraceCheckUtils]: 87: Hoare triple {89718#true} call stubMoreProcessingRequired(); {89896#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:34,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {89718#true} is VALID [2022-04-15 11:36:34,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,042 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {89718#true} {89718#true} #1212#return; {89718#true} is VALID [2022-04-15 11:36:34,042 INFO L290 TraceCheckUtils]: 91: Hoare triple {89718#true} assume !(0 == ~__BLAST_NONDET~11); {89718#true} is VALID [2022-04-15 11:36:34,042 INFO L290 TraceCheckUtils]: 92: Hoare triple {89718#true} assume 1 == ~__BLAST_NONDET~11; {89718#true} is VALID [2022-04-15 11:36:34,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {89718#true} ~returnVal2~0 := -1073741823; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,043 INFO L290 TraceCheckUtils]: 94: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,043 INFO L290 TraceCheckUtils]: 95: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,043 INFO L290 TraceCheckUtils]: 96: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 11:36:34,044 INFO L290 TraceCheckUtils]: 97: Hoare triple {89890#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} #res := ~returnVal2~0; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:34,044 INFO L290 TraceCheckUtils]: 98: Hoare triple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} assume true; {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} is VALID [2022-04-15 11:36:34,045 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {89891#(<= (+ |IofCallDriver_#res| 1073741823) 0)} {89718#true} #1192#return; {89872#(<= (+ 1073741823 |KbFilter_PnP_#t~ret109|) 0)} is VALID [2022-04-15 11:36:34,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {89872#(<= (+ 1073741823 |KbFilter_PnP_#t~ret109|) 0)} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} is VALID [2022-04-15 11:36:34,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} assume !(259 == ~status~3); {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} is VALID [2022-04-15 11:36:34,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {89873#(<= (+ KbFilter_PnP_~status~3 1073741823) 0)} assume ~status~3 >= 0; {89719#false} is VALID [2022-04-15 11:36:34,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {89719#false} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 104: Hoare triple {89719#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L272 TraceCheckUtils]: 105: Hoare triple {89719#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {89896#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {89896#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {89718#true} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {89718#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {89718#true} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {89718#true} assume true; {89718#true} is VALID [2022-04-15 11:36:34,047 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {89718#true} {89719#false} #1196#return; {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {89719#false} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {89719#false} assume true; {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {89719#false} {89718#true} #1230#return; {89719#false} is VALID [2022-04-15 11:36:34,047 INFO L290 TraceCheckUtils]: 113: Hoare triple {89719#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {89719#false} assume 0 != ~we_should_unload~0; {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 115: Hoare triple {89719#false} assume !(1 == ~pended~0); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {89719#false} assume !(1 == ~pended~0); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {89719#false} assume !(~s~0 == ~UNLOADED~0); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {89719#false} assume !(-1 == ~status~5); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {89719#false} assume ~s~0 != ~SKIP2~0; {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {89719#false} assume ~s~0 != ~IPC~0; {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 121: Hoare triple {89719#false} assume !(~s~0 != ~DC~0); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 122: Hoare triple {89719#false} assume !(1 == ~pended~0); {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {89719#false} assume ~s~0 == ~DC~0; {89719#false} is VALID [2022-04-15 11:36:34,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {89719#false} assume 259 == ~status~5; {89719#false} is VALID [2022-04-15 11:36:34,049 INFO L272 TraceCheckUtils]: 125: Hoare triple {89719#false} call errorFn(); {89719#false} is VALID [2022-04-15 11:36:34,049 INFO L290 TraceCheckUtils]: 126: Hoare triple {89719#false} assume !false; {89719#false} is VALID [2022-04-15 11:36:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:36:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:34,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569424923] [2022-04-15 11:36:34,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569424923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:34,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:34,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:36:34,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706961187] [2022-04-15 11:36:34,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706961187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:34,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:34,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:36:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155569656] [2022-04-15 11:36:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2022-04-15 11:36:34,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:34,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:34,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:34,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:36:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:36:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:36:34,169 INFO L87 Difference]: Start difference. First operand 271 states and 294 transitions. Second operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:36,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:42,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:44,555 INFO L93 Difference]: Finished difference Result 323 states and 354 transitions. [2022-04-15 11:36:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:36:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2022-04-15 11:36:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2022-04-15 11:36:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2022-04-15 11:36:44,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 213 transitions. [2022-04-15 11:36:44,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:44,818 INFO L225 Difference]: With dead ends: 323 [2022-04-15 11:36:44,818 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 11:36:44,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-04-15 11:36:44,818 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 193 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 125 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:44,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 422 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 722 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:36:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 11:36:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2022-04-15 11:36:45,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:45,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:45,400 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:45,400 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:45,403 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2022-04-15 11:36:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2022-04-15 11:36:45,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:45,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:45,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 253 states. [2022-04-15 11:36:45,403 INFO L87 Difference]: Start difference. First operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 253 states. [2022-04-15 11:36:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:45,406 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2022-04-15 11:36:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2022-04-15 11:36:45,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:45,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:45,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:45,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 173 states have internal predecessors, (188), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 248 transitions. [2022-04-15 11:36:45,409 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 248 transitions. Word has length 127 [2022-04-15 11:36:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:45,409 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 248 transitions. [2022-04-15 11:36:45,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 11 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-04-15 11:36:45,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 248 transitions. [2022-04-15 11:36:46,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 248 transitions. [2022-04-15 11:36:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 11:36:46,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:46,106 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:46,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 11:36:46,106 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1600651777, now seen corresponding path program 1 times [2022-04-15 11:36:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:46,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556812697] [2022-04-15 11:36:46,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:36:46,114 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:36:46,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1600651777, now seen corresponding path program 2 times [2022-04-15 11:36:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:46,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119898267] [2022-04-15 11:36:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {91637#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91530#true} {91530#true} #1270#return; {91530#true} is VALID [2022-04-15 11:36:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:36:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {91638#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91530#true} {91530#true} #1216#return; {91530#true} is VALID [2022-04-15 11:36:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:36:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {91530#true} ~cond := #in~cond; {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume !(0 == ~cond); {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91530#true} {91530#true} #1254#return; {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L272 TraceCheckUtils]: 1: Hoare triple {91530#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {91530#true} is VALID [2022-04-15 11:36:46,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} ~cond := #in~cond; {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume !(0 == ~cond); {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {91530#true} {91530#true} #1254#return; {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {91530#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,524 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {91530#true} {91530#true} #1218#return; {91530#true} is VALID [2022-04-15 11:36:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:36:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {91530#true} is VALID [2022-04-15 11:36:46,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~5; {91530#true} is VALID [2022-04-15 11:36:46,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:46,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,605 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91530#true} {91530#true} #1176#return; {91530#true} is VALID [2022-04-15 11:36:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:36:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:46,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:36:46,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,702 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {91530#true} #1178#return; {91531#false} is VALID [2022-04-15 11:36:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:36:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {91530#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {91530#true} is VALID [2022-04-15 11:36:46,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~2; {91530#true} is VALID [2022-04-15 11:36:46,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {91530#true} is VALID [2022-04-15 11:36:46,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,708 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91530#true} {91531#false} #1180#return; {91531#false} is VALID [2022-04-15 11:36:46,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,709 INFO L272 TraceCheckUtils]: 1: Hoare triple {91530#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:46,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {91530#true} is VALID [2022-04-15 11:36:46,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~5; {91530#true} is VALID [2022-04-15 11:36:46,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {91530#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:46,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,710 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {91530#true} {91530#true} #1176#return; {91530#true} is VALID [2022-04-15 11:36:46,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {91530#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {91530#true} is VALID [2022-04-15 11:36:46,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {91530#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,710 INFO L272 TraceCheckUtils]: 9: Hoare triple {91530#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:46,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:46,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:36:46,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,714 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {91530#true} #1178#return; {91531#false} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {91531#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {91531#false} is VALID [2022-04-15 11:36:46,714 INFO L272 TraceCheckUtils]: 16: Hoare triple {91531#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {91530#true} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {91530#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {91530#true} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~2; {91530#true} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {91530#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {91530#true} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,714 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {91530#true} {91531#false} #1180#return; {91531#false} is VALID [2022-04-15 11:36:46,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {91531#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {91531#false} is VALID [2022-04-15 11:36:46,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:46,715 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {91531#false} {91530#true} #1220#return; {91531#false} is VALID [2022-04-15 11:36:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:36:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {91663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91530#true} {91531#false} #1222#return; {91531#false} is VALID [2022-04-15 11:36:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:36:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:36:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {91530#true} is VALID [2022-04-15 11:36:46,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {91530#true} is VALID [2022-04-15 11:36:46,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {91530#true} is VALID [2022-04-15 11:36:46,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume #res.base == dest.base && #res.offset == dest.offset; {91530#true} is VALID [2022-04-15 11:36:46,790 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91530#true} {91530#true} #1186#return; {91530#true} is VALID [2022-04-15 11:36:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:36:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91530#true} is VALID [2022-04-15 11:36:46,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91530#true} {91530#true} #1174#return; {91530#true} is VALID [2022-04-15 11:36:46,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {91530#true} is VALID [2022-04-15 11:36:46,831 INFO L272 TraceCheckUtils]: 1: Hoare triple {91530#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91530#true} is VALID [2022-04-15 11:36:46,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,832 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {91530#true} {91530#true} #1174#return; {91530#true} is VALID [2022-04-15 11:36:46,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {91530#true} is VALID [2022-04-15 11:36:46,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,832 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91530#true} {91530#true} #1210#return; {91530#true} is VALID [2022-04-15 11:36:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91530#true} {91530#true} #1212#return; {91530#true} is VALID [2022-04-15 11:36:46,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {91707#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume 0 != ~compRegistered~0; {91530#true} is VALID [2022-04-15 11:36:46,848 INFO L272 TraceCheckUtils]: 2: Hoare triple {91530#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {91530#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {91530#true} {91530#true} #1174#return; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {91530#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {91530#true} {91530#true} #1210#return; {91530#true} is VALID [2022-04-15 11:36:46,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {91530#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {91530#true} assume -1073741802 == ~compRetStatus~0; {91530#true} is VALID [2022-04-15 11:36:46,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {91530#true} call stubMoreProcessingRequired(); {91723#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91530#true} {91530#true} #1212#return; {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {91530#true} assume !(0 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {91530#true} assume !(1 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {91530#true} ~returnVal2~0 := 259; {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {91530#true} assume !(~s~0 == ~NP~0); {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {91530#true} assume ~s~0 == ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {91530#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {91530#true} #res := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,865 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {91530#true} {91530#true} #1192#return; {91530#true} is VALID [2022-04-15 11:36:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 11:36:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {91724#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume ~s~0 == ~MPR3~0; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~13; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {91530#true} #res := 0; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,889 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {91530#true} {91530#true} #1194#return; {91530#true} is VALID [2022-04-15 11:36:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 11:36:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:46,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91530#true} {91530#true} #1196#return; {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {91664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {91530#true} is VALID [2022-04-15 11:36:46,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {91530#true} is VALID [2022-04-15 11:36:46,897 INFO L272 TraceCheckUtils]: 3: Hoare triple {91530#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:46,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {91530#true} is VALID [2022-04-15 11:36:46,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {91530#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {91530#true} assume #res.base == dest.base && #res.offset == dest.offset; {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {91530#true} {91530#true} #1186#return; {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {91530#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {91530#true} assume !(~s~0 != ~NP~0); {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {91530#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {91530#true} is VALID [2022-04-15 11:36:46,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {91530#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,899 INFO L272 TraceCheckUtils]: 13: Hoare triple {91530#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {91707#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {91707#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {91530#true} assume 0 != ~compRegistered~0; {91530#true} is VALID [2022-04-15 11:36:46,901 INFO L272 TraceCheckUtils]: 16: Hoare triple {91530#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {91530#true} is VALID [2022-04-15 11:36:46,901 INFO L272 TraceCheckUtils]: 18: Hoare triple {91530#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {91530#true} {91530#true} #1174#return; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {91530#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {91530#true} {91530#true} #1210#return; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {91530#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {91530#true} assume -1073741802 == ~compRetStatus~0; {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L272 TraceCheckUtils]: 27: Hoare triple {91530#true} call stubMoreProcessingRequired(); {91723#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {91530#true} {91530#true} #1212#return; {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {91530#true} assume !(0 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {91530#true} assume !(1 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {91530#true} ~returnVal2~0 := 259; {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {91530#true} assume !(~s~0 == ~NP~0); {91530#true} is VALID [2022-04-15 11:36:46,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {91530#true} assume ~s~0 == ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {91530#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {91530#true} #res := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {91530#true} {91530#true} #1192#return; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {91530#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {91530#true} is VALID [2022-04-15 11:36:46,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {91530#true} assume 259 == ~status~3; {91530#true} is VALID [2022-04-15 11:36:46,905 INFO L272 TraceCheckUtils]: 42: Hoare triple {91530#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {91724#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {91724#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {91530#true} is VALID [2022-04-15 11:36:46,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {91530#true} assume ~s~0 == ~MPR3~0; {91530#true} is VALID [2022-04-15 11:36:46,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {91530#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~13; {91530#true} is VALID [2022-04-15 11:36:46,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {91530#true} #res := 0; {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {91530#true} {91530#true} #1194#return; {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {91530#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {91530#true} assume ~status~3 >= 0; {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {91530#true} assume !(~myStatus~0 >= 0); {91530#true} is VALID [2022-04-15 11:36:46,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {91530#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L272 TraceCheckUtils]: 54: Hoare triple {91530#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {91723#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:46,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {91530#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {91530#true} {91530#true} #1196#return; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {91530#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,907 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {91530#true} {91531#false} #1230#return; {91531#false} is VALID [2022-04-15 11:36:46,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {91530#true} call ULTIMATE.init(); {91637#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:36:46,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {91637#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91530#true} {91530#true} #1270#return; {91530#true} is VALID [2022-04-15 11:36:46,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {91530#true} call #t~ret213 := main(); {91530#true} is VALID [2022-04-15 11:36:46,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {91530#true} is VALID [2022-04-15 11:36:46,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {91530#true} call _BLAST_init(); {91638#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {91638#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,911 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {91530#true} {91530#true} #1216#return; {91530#true} is VALID [2022-04-15 11:36:46,911 INFO L272 TraceCheckUtils]: 10: Hoare triple {91530#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:46,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L272 TraceCheckUtils]: 12: Hoare triple {91530#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {91530#true} ~cond := #in~cond; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {91530#true} assume !(0 == ~cond); {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91530#true} {91530#true} #1254#return; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {91530#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {91530#true} {91530#true} #1218#return; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {91530#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {91530#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {91530#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {91530#true} is VALID [2022-04-15 11:36:46,913 INFO L272 TraceCheckUtils]: 23: Hoare triple {91530#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:46,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L272 TraceCheckUtils]: 25: Hoare triple {91530#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {91644#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~5; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {91530#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {91530#true} {91530#true} #1176#return; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {91530#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {91530#true} is VALID [2022-04-15 11:36:46,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {91530#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,916 INFO L272 TraceCheckUtils]: 33: Hoare triple {91530#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:46,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:46,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {91660#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:36:46,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {91661#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:46,920 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {91662#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {91530#true} #1178#return; {91531#false} is VALID [2022-04-15 11:36:46,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {91531#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {91531#false} is VALID [2022-04-15 11:36:46,920 INFO L272 TraceCheckUtils]: 40: Hoare triple {91531#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {91530#true} is VALID [2022-04-15 11:36:46,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {91530#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {91530#true} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~2; {91530#true} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {91530#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {91530#true} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,921 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {91530#true} {91531#false} #1180#return; {91531#false} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {91531#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {91531#false} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:46,921 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {91531#false} {91530#true} #1220#return; {91531#false} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {91531#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {91531#false} is VALID [2022-04-15 11:36:46,921 INFO L272 TraceCheckUtils]: 50: Hoare triple {91531#false} call stub_driver_init(); {91663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {91663#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,922 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {91530#true} {91531#false} #1222#return; {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {91531#false} assume !!(~status~5 >= 0); {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {91531#false} assume !(0 == ~__BLAST_NONDET~0); {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {91531#false} assume !(1 == ~__BLAST_NONDET~0); {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {91531#false} assume !(2 == ~__BLAST_NONDET~0); {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {91531#false} assume 3 == ~__BLAST_NONDET~0; {91531#false} is VALID [2022-04-15 11:36:46,922 INFO L272 TraceCheckUtils]: 59: Hoare triple {91531#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {91664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {91664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {91530#true} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {91530#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {91530#true} is VALID [2022-04-15 11:36:46,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {91530#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {91530#true} is VALID [2022-04-15 11:36:46,923 INFO L272 TraceCheckUtils]: 63: Hoare triple {91530#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:46,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {91639#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {91530#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {91530#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {91530#true} assume #res.base == dest.base && #res.offset == dest.offset; {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {91530#true} {91530#true} #1186#return; {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 69: Hoare triple {91530#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {91530#true} assume !(~s~0 != ~NP~0); {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {91530#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {91530#true} is VALID [2022-04-15 11:36:46,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {91530#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,925 INFO L272 TraceCheckUtils]: 73: Hoare triple {91530#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {91707#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {91707#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {91530#true} assume 0 != ~compRegistered~0; {91530#true} is VALID [2022-04-15 11:36:46,926 INFO L272 TraceCheckUtils]: 76: Hoare triple {91530#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L272 TraceCheckUtils]: 78: Hoare triple {91530#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:46,927 INFO L290 TraceCheckUtils]: 79: Hoare triple {91719#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {91530#true} {91530#true} #1174#return; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {91530#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,927 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {91530#true} {91530#true} #1210#return; {91530#true} is VALID [2022-04-15 11:36:46,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {91530#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {91530#true} is VALID [2022-04-15 11:36:46,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {91530#true} assume -1073741802 == ~compRetStatus~0; {91530#true} is VALID [2022-04-15 11:36:46,928 INFO L272 TraceCheckUtils]: 87: Hoare triple {91530#true} call stubMoreProcessingRequired(); {91723#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:46,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,928 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {91530#true} {91530#true} #1212#return; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {91530#true} assume !(0 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {91530#true} assume !(1 == ~__BLAST_NONDET~11); {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {91530#true} ~returnVal2~0 := 259; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {91530#true} assume !(~s~0 == ~NP~0); {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 95: Hoare triple {91530#true} assume ~s~0 == ~MPR1~0; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 96: Hoare triple {91530#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 97: Hoare triple {91530#true} #res := ~returnVal2~0; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 98: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {91530#true} {91530#true} #1192#return; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 100: Hoare triple {91530#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {91530#true} is VALID [2022-04-15 11:36:46,929 INFO L290 TraceCheckUtils]: 101: Hoare triple {91530#true} assume 259 == ~status~3; {91530#true} is VALID [2022-04-15 11:36:46,930 INFO L272 TraceCheckUtils]: 102: Hoare triple {91530#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {91724#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {91724#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 104: Hoare triple {91530#true} assume ~s~0 == ~MPR3~0; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 105: Hoare triple {91530#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~13; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {91530#true} #res := 0; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {91530#true} {91530#true} #1194#return; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {91530#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {91530#true} assume ~status~3 >= 0; {91530#true} is VALID [2022-04-15 11:36:46,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {91530#true} assume !(~myStatus~0 >= 0); {91530#true} is VALID [2022-04-15 11:36:46,932 INFO L290 TraceCheckUtils]: 113: Hoare triple {91530#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {91530#true} is VALID [2022-04-15 11:36:46,932 INFO L272 TraceCheckUtils]: 114: Hoare triple {91530#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {91723#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:46,932 INFO L290 TraceCheckUtils]: 115: Hoare triple {91723#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {91530#true} is VALID [2022-04-15 11:36:46,932 INFO L290 TraceCheckUtils]: 116: Hoare triple {91530#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {91530#true} is VALID [2022-04-15 11:36:46,932 INFO L290 TraceCheckUtils]: 117: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,933 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {91530#true} {91530#true} #1196#return; {91530#true} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 119: Hoare triple {91530#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {91530#true} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 120: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:46,933 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {91530#true} {91531#false} #1230#return; {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 122: Hoare triple {91531#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 123: Hoare triple {91531#false} assume 0 != ~we_should_unload~0; {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 124: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 125: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 126: Hoare triple {91531#false} assume !(~s~0 == ~UNLOADED~0); {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 127: Hoare triple {91531#false} assume !(-1 == ~status~5); {91531#false} is VALID [2022-04-15 11:36:46,933 INFO L290 TraceCheckUtils]: 128: Hoare triple {91531#false} assume ~s~0 != ~SKIP2~0; {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 129: Hoare triple {91531#false} assume ~s~0 != ~IPC~0; {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 130: Hoare triple {91531#false} assume !(~s~0 != ~DC~0); {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 131: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {91531#false} assume ~s~0 == ~DC~0; {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {91531#false} assume 259 == ~status~5; {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L272 TraceCheckUtils]: 134: Hoare triple {91531#false} call errorFn(); {91531#false} is VALID [2022-04-15 11:36:46,934 INFO L290 TraceCheckUtils]: 135: Hoare triple {91531#false} assume !false; {91531#false} is VALID [2022-04-15 11:36:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:36:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:46,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119898267] [2022-04-15 11:36:46,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119898267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:36:46,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366642895] [2022-04-15 11:36:46,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:36:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:36:46,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:36:46,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:36:46,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 11:36:48,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:36:48,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:36:48,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 11:36:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:48,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:36:48,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {91530#true} call ULTIMATE.init(); {91530#true} is VALID [2022-04-15 11:36:48,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {91530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {91530#true} is VALID [2022-04-15 11:36:48,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91530#true} {91530#true} #1270#return; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {91530#true} call #t~ret213 := main(); {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {91530#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L272 TraceCheckUtils]: 6: Hoare triple {91530#true} call _BLAST_init(); {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {91530#true} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {91530#true} {91530#true} #1216#return; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L272 TraceCheckUtils]: 10: Hoare triple {91530#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {91530#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L272 TraceCheckUtils]: 12: Hoare triple {91530#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {91530#true} ~cond := #in~cond; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {91530#true} assume !(0 == ~cond); {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {91530#true} {91530#true} #1254#return; {91530#true} is VALID [2022-04-15 11:36:48,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {91530#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {91530#true} {91530#true} #1218#return; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {91530#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {91530#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {91530#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L272 TraceCheckUtils]: 23: Hoare triple {91530#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {91530#true} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L272 TraceCheckUtils]: 25: Hoare triple {91530#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {91530#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~5; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {91530#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,647 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {91530#true} {91530#true} #1176#return; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {91530#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {91530#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L272 TraceCheckUtils]: 33: Hoare triple {91530#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {91530#true} #t~loopctr214 := 0; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {91530#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {91530#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {91530#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {91530#true} {91530#true} #1178#return; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {91530#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L272 TraceCheckUtils]: 40: Hoare triple {91530#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {91530#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {91530#true} assume 0 == ~__BLAST_NONDET~2; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {91530#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,648 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {91530#true} {91530#true} #1180#return; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {91530#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {91530#true} {91530#true} #1220#return; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {91530#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L272 TraceCheckUtils]: 50: Hoare triple {91530#true} call stub_driver_init(); {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {91530#true} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {91530#true} assume true; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {91530#true} {91530#true} #1222#return; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {91530#true} assume !!(~status~5 >= 0); {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {91530#true} assume !(0 == ~__BLAST_NONDET~0); {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {91530#true} assume !(1 == ~__BLAST_NONDET~0); {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {91530#true} assume !(2 == ~__BLAST_NONDET~0); {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {91530#true} assume 3 == ~__BLAST_NONDET~0; {91530#true} is VALID [2022-04-15 11:36:48,649 INFO L272 TraceCheckUtils]: 59: Hoare triple {91530#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {91530#true} is VALID [2022-04-15 11:36:48,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {91530#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {91530#true} is VALID [2022-04-15 11:36:48,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {91530#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {91530#true} is VALID [2022-04-15 11:36:48,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {91530#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {91530#true} is VALID [2022-04-15 11:36:48,650 INFO L272 TraceCheckUtils]: 63: Hoare triple {91530#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {91530#true} is VALID [2022-04-15 11:36:48,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {91530#true} #t~loopctr215 := 0; {91920#(= |#Ultimate.C_memmove_#t~loopctr215| 0)} is VALID [2022-04-15 11:36:48,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {91920#(= |#Ultimate.C_memmove_#t~loopctr215| 0)} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} is VALID [2022-04-15 11:36:48,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} is VALID [2022-04-15 11:36:48,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} assume #res.base == dest.base && #res.offset == dest.offset; {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} is VALID [2022-04-15 11:36:48,652 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {91924#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} {91530#true} #1186#return; {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {91531#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {91531#false} assume !(~s~0 != ~NP~0); {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {91531#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {91531#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L272 TraceCheckUtils]: 73: Hoare triple {91531#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 74: Hoare triple {91531#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {91531#false} is VALID [2022-04-15 11:36:48,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {91531#false} assume 0 != ~compRegistered~0; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L272 TraceCheckUtils]: 76: Hoare triple {91531#false} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {91531#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L272 TraceCheckUtils]: 78: Hoare triple {91531#false} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {91531#false} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 80: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {91531#false} {91531#false} #1174#return; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {91531#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {91531#false} {91531#false} #1210#return; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {91531#false} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {91531#false} assume -1073741802 == ~compRetStatus~0; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L272 TraceCheckUtils]: 87: Hoare triple {91531#false} call stubMoreProcessingRequired(); {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 88: Hoare triple {91531#false} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L290 TraceCheckUtils]: 89: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,653 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {91531#false} {91531#false} #1212#return; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 91: Hoare triple {91531#false} assume !(0 == ~__BLAST_NONDET~11); {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 92: Hoare triple {91531#false} assume !(1 == ~__BLAST_NONDET~11); {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 93: Hoare triple {91531#false} ~returnVal2~0 := 259; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 94: Hoare triple {91531#false} assume !(~s~0 == ~NP~0); {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {91531#false} assume ~s~0 == ~MPR1~0; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {91531#false} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 97: Hoare triple {91531#false} #res := ~returnVal2~0; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {91531#false} {91531#false} #1192#return; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {91531#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {91531#false} is VALID [2022-04-15 11:36:48,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {91531#false} assume 259 == ~status~3; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L272 TraceCheckUtils]: 102: Hoare triple {91531#false} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 103: Hoare triple {91531#false} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 104: Hoare triple {91531#false} assume ~s~0 == ~MPR3~0; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 105: Hoare triple {91531#false} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 106: Hoare triple {91531#false} assume 0 == ~__BLAST_NONDET~13; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 107: Hoare triple {91531#false} #res := 0; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 108: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {91531#false} {91531#false} #1194#return; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 110: Hoare triple {91531#false} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {91531#false} is VALID [2022-04-15 11:36:48,655 INFO L290 TraceCheckUtils]: 111: Hoare triple {91531#false} assume ~status~3 >= 0; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 112: Hoare triple {91531#false} assume !(~myStatus~0 >= 0); {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 113: Hoare triple {91531#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L272 TraceCheckUtils]: 114: Hoare triple {91531#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 115: Hoare triple {91531#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 116: Hoare triple {91531#false} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 117: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {91531#false} {91531#false} #1196#return; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 119: Hoare triple {91531#false} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L290 TraceCheckUtils]: 120: Hoare triple {91531#false} assume true; {91531#false} is VALID [2022-04-15 11:36:48,656 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {91531#false} {91530#true} #1230#return; {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 122: Hoare triple {91531#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 123: Hoare triple {91531#false} assume 0 != ~we_should_unload~0; {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 124: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 125: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 126: Hoare triple {91531#false} assume !(~s~0 == ~UNLOADED~0); {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 127: Hoare triple {91531#false} assume !(-1 == ~status~5); {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 128: Hoare triple {91531#false} assume ~s~0 != ~SKIP2~0; {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 129: Hoare triple {91531#false} assume ~s~0 != ~IPC~0; {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 130: Hoare triple {91531#false} assume !(~s~0 != ~DC~0); {91531#false} is VALID [2022-04-15 11:36:48,657 INFO L290 TraceCheckUtils]: 131: Hoare triple {91531#false} assume !(1 == ~pended~0); {91531#false} is VALID [2022-04-15 11:36:48,658 INFO L290 TraceCheckUtils]: 132: Hoare triple {91531#false} assume ~s~0 == ~DC~0; {91531#false} is VALID [2022-04-15 11:36:48,658 INFO L290 TraceCheckUtils]: 133: Hoare triple {91531#false} assume 259 == ~status~5; {91531#false} is VALID [2022-04-15 11:36:48,658 INFO L272 TraceCheckUtils]: 134: Hoare triple {91531#false} call errorFn(); {91531#false} is VALID [2022-04-15 11:36:48,658 INFO L290 TraceCheckUtils]: 135: Hoare triple {91531#false} assume !false; {91531#false} is VALID [2022-04-15 11:36:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:36:48,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:36:48,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366642895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:48,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:36:48,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2022-04-15 11:36:48,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:48,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556812697] [2022-04-15 11:36:48,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556812697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:48,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:48,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:36:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282177312] [2022-04-15 11:36:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2022-04-15 11:36:48,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:48,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:36:48,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:48,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:36:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:36:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-15 11:36:48,781 INFO L87 Difference]: Start difference. First operand 233 states and 248 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:36:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:56,561 INFO L93 Difference]: Finished difference Result 361 states and 386 transitions. [2022-04-15 11:36:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:36:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2022-04-15 11:36:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:36:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 11:36:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:36:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 11:36:56,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-15 11:36:56,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:56,734 INFO L225 Difference]: With dead ends: 361 [2022-04-15 11:36:56,734 INFO L226 Difference]: Without dead ends: 235 [2022-04-15 11:36:56,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:36:56,735 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:56,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 430 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:36:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-15 11:36:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-04-15 11:36:57,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:57,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:57,350 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:57,350 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:57,353 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2022-04-15 11:36:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 250 transitions. [2022-04-15 11:36:57,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:57,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:57,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 235 states. [2022-04-15 11:36:57,354 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 235 states. [2022-04-15 11:36:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:57,357 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2022-04-15 11:36:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 250 transitions. [2022-04-15 11:36:57,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:57,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:57,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:57,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:36:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 250 transitions. [2022-04-15 11:36:57,360 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 250 transitions. Word has length 136 [2022-04-15 11:36:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:57,360 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 250 transitions. [2022-04-15 11:36:57,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:36:57,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 250 transitions. [2022-04-15 11:36:58,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 250 transitions. [2022-04-15 11:36:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 11:36:58,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:58,100 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:36:58,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 11:36:58,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:36:58,300 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1917947804, now seen corresponding path program 1 times [2022-04-15 11:36:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675533971] [2022-04-15 11:36:58,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:36:58,303 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:36:58,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1917947804, now seen corresponding path program 2 times [2022-04-15 11:36:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:58,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358035270] [2022-04-15 11:36:58,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {93906#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {93798#true} is VALID [2022-04-15 11:36:58,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93798#true} {93798#true} #1270#return; {93798#true} is VALID [2022-04-15 11:36:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:36:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {93907#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:36:58,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93798#true} {93798#true} #1216#return; {93798#true} is VALID [2022-04-15 11:36:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:36:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {93798#true} ~cond := #in~cond; {93798#true} is VALID [2022-04-15 11:36:58,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume !(0 == ~cond); {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93798#true} {93798#true} #1254#return; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L272 TraceCheckUtils]: 1: Hoare triple {93798#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} ~cond := #in~cond; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume !(0 == ~cond); {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {93798#true} {93798#true} #1254#return; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {93798#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,752 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {93798#true} {93798#true} #1218#return; {93798#true} is VALID [2022-04-15 11:36:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:36:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {93798#true} is VALID [2022-04-15 11:36:58,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~5; {93798#true} is VALID [2022-04-15 11:36:58,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:36:58,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,822 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93798#true} {93798#true} #1176#return; {93798#true} is VALID [2022-04-15 11:36:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:36:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:58,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:36:58,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:58,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:58,917 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {93798#true} #1178#return; {93799#false} is VALID [2022-04-15 11:36:58,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:36:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {93798#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {93798#true} is VALID [2022-04-15 11:36:58,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~2; {93798#true} is VALID [2022-04-15 11:36:58,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {93798#true} is VALID [2022-04-15 11:36:58,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,923 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93798#true} {93799#false} #1180#return; {93799#false} is VALID [2022-04-15 11:36:58,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L272 TraceCheckUtils]: 1: Hoare triple {93798#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~5; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {93798#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {93798#true} {93798#true} #1176#return; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {93798#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {93798#true} is VALID [2022-04-15 11:36:58,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {93798#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {93798#true} is VALID [2022-04-15 11:36:58,926 INFO L272 TraceCheckUtils]: 9: Hoare triple {93798#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:58,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:58,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:36:58,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:58,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:58,930 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {93798#true} #1178#return; {93799#false} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {93799#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {93799#false} is VALID [2022-04-15 11:36:58,930 INFO L272 TraceCheckUtils]: 16: Hoare triple {93799#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {93798#true} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {93798#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {93798#true} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~2; {93798#true} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {93798#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {93798#true} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,930 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {93798#true} {93799#false} #1180#return; {93799#false} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {93799#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {93799#false} is VALID [2022-04-15 11:36:58,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:36:58,930 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {93799#false} {93798#true} #1220#return; {93799#false} is VALID [2022-04-15 11:36:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:36:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {93932#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:36:58,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:58,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93798#true} {93799#false} #1222#return; {93799#false} is VALID [2022-04-15 11:36:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:36:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:36:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {93798#true} is VALID [2022-04-15 11:36:59,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {93798#true} is VALID [2022-04-15 11:36:59,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {93798#true} is VALID [2022-04-15 11:36:59,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {93798#true} is VALID [2022-04-15 11:36:59,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {93798#true} assume #res.base == dest.base && #res.offset == dest.offset; {93798#true} is VALID [2022-04-15 11:36:59,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {93798#true} {93798#true} #1186#return; {93798#true} is VALID [2022-04-15 11:36:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 11:36:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:36:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:36:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93798#true} is VALID [2022-04-15 11:36:59,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93798#true} {93798#true} #1174#return; {93798#true} is VALID [2022-04-15 11:36:59,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {93798#true} is VALID [2022-04-15 11:36:59,075 INFO L272 TraceCheckUtils]: 1: Hoare triple {93798#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93798#true} is VALID [2022-04-15 11:36:59,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,075 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93798#true} {93798#true} #1174#return; {93798#true} is VALID [2022-04-15 11:36:59,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {93798#true} is VALID [2022-04-15 11:36:59,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,076 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {93798#true} {93798#true} #1210#return; {93798#true} is VALID [2022-04-15 11:36:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:36:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93798#true} {93798#true} #1212#return; {93798#true} is VALID [2022-04-15 11:36:59,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {93977#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume 0 != ~compRegistered~0; {93798#true} is VALID [2022-04-15 11:36:59,093 INFO L272 TraceCheckUtils]: 2: Hoare triple {93798#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {93798#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {93798#true} {93798#true} #1174#return; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {93798#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {93798#true} {93798#true} #1210#return; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {93798#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {93798#true} assume -1073741802 == ~compRetStatus~0; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {93798#true} call stubMoreProcessingRequired(); {93993#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {93798#true} {93798#true} #1212#return; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {93798#true} assume !(0 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {93798#true} assume !(1 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {93798#true} ~returnVal2~0 := 259; {93798#true} is VALID [2022-04-15 11:36:59,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {93798#true} assume !(~s~0 == ~NP~0); {93798#true} is VALID [2022-04-15 11:36:59,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {93798#true} assume ~s~0 == ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {93798#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {93798#true} #res := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,096 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {93798#true} {93798#true} #1192#return; {93798#true} is VALID [2022-04-15 11:36:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 11:36:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {93994#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume ~s~0 == ~MPR3~0; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~13; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {93798#true} #res := 0; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {93798#true} {93798#true} #1194#return; {93798#true} is VALID [2022-04-15 11:36:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-15 11:36:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93798#true} {93798#true} #1196#return; {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {93933#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {93798#true} is VALID [2022-04-15 11:36:59,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {93798#true} is VALID [2022-04-15 11:36:59,122 INFO L272 TraceCheckUtils]: 3: Hoare triple {93798#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:59,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {93798#true} is VALID [2022-04-15 11:36:59,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {93798#true} is VALID [2022-04-15 11:36:59,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {93798#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {93798#true} is VALID [2022-04-15 11:36:59,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {93798#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {93798#true} assume #res.base == dest.base && #res.offset == dest.offset; {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {93798#true} {93798#true} #1186#return; {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {93798#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {93798#true} assume !(~s~0 != ~NP~0); {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {93798#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {93798#true} is VALID [2022-04-15 11:36:59,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {93798#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {93798#true} is VALID [2022-04-15 11:36:59,124 INFO L272 TraceCheckUtils]: 14: Hoare triple {93798#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {93977#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {93977#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {93798#true} assume 0 != ~compRegistered~0; {93798#true} is VALID [2022-04-15 11:36:59,125 INFO L272 TraceCheckUtils]: 17: Hoare triple {93798#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {93798#true} is VALID [2022-04-15 11:36:59,125 INFO L272 TraceCheckUtils]: 19: Hoare triple {93798#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {93798#true} {93798#true} #1174#return; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {93798#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {93798#true} {93798#true} #1210#return; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {93798#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {93798#true} assume -1073741802 == ~compRetStatus~0; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L272 TraceCheckUtils]: 28: Hoare triple {93798#true} call stubMoreProcessingRequired(); {93993#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {93798#true} {93798#true} #1212#return; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {93798#true} assume !(0 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {93798#true} assume !(1 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {93798#true} ~returnVal2~0 := 259; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {93798#true} assume !(~s~0 == ~NP~0); {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {93798#true} assume ~s~0 == ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {93798#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {93798#true} #res := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {93798#true} {93798#true} #1192#return; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {93798#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {93798#true} is VALID [2022-04-15 11:36:59,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {93798#true} assume 259 == ~status~3; {93798#true} is VALID [2022-04-15 11:36:59,128 INFO L272 TraceCheckUtils]: 43: Hoare triple {93798#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {93994#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {93994#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {93798#true} is VALID [2022-04-15 11:36:59,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {93798#true} assume ~s~0 == ~MPR3~0; {93798#true} is VALID [2022-04-15 11:36:59,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {93798#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~13; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {93798#true} #res := 0; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {93798#true} {93798#true} #1194#return; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {93798#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {93798#true} assume ~status~3 >= 0; {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {93798#true} assume !(~myStatus~0 >= 0); {93798#true} is VALID [2022-04-15 11:36:59,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {93798#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L272 TraceCheckUtils]: 55: Hoare triple {93798#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {93993#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:59,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {93798#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {93798#true} {93798#true} #1196#return; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {93798#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,130 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {93798#true} {93799#false} #1230#return; {93799#false} is VALID [2022-04-15 11:36:59,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {93798#true} call ULTIMATE.init(); {93906#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:36:59,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {93906#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93798#true} {93798#true} #1270#return; {93798#true} is VALID [2022-04-15 11:36:59,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {93798#true} call #t~ret213 := main(); {93798#true} is VALID [2022-04-15 11:36:59,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {93798#true} is VALID [2022-04-15 11:36:59,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {93798#true} call _BLAST_init(); {93907#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {93907#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,133 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {93798#true} {93798#true} #1216#return; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L272 TraceCheckUtils]: 10: Hoare triple {93798#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L272 TraceCheckUtils]: 12: Hoare triple {93798#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {93798#true} ~cond := #in~cond; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {93798#true} assume !(0 == ~cond); {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {93798#true} {93798#true} #1254#return; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {93798#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,134 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {93798#true} {93798#true} #1218#return; {93798#true} is VALID [2022-04-15 11:36:59,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {93798#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {93798#true} is VALID [2022-04-15 11:36:59,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {93798#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {93798#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {93798#true} is VALID [2022-04-15 11:36:59,136 INFO L272 TraceCheckUtils]: 23: Hoare triple {93798#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:59,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L272 TraceCheckUtils]: 25: Hoare triple {93798#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {93913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~5; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {93798#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {93798#true} {93798#true} #1176#return; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {93798#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {93798#true} is VALID [2022-04-15 11:36:59,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {93798#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {93798#true} is VALID [2022-04-15 11:36:59,138 INFO L272 TraceCheckUtils]: 33: Hoare triple {93798#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:59,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:36:59,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {93929#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} is VALID [2022-04-15 11:36:59,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {93930#(and (or (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0)))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:59,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:36:59,142 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {93931#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {93798#true} #1178#return; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {93799#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L272 TraceCheckUtils]: 40: Hoare triple {93799#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {93798#true} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {93798#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {93798#true} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~2; {93798#true} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {93798#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {93798#true} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,142 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {93798#true} {93799#false} #1180#return; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {93799#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {93799#false} {93798#true} #1220#return; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {93799#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {93799#false} is VALID [2022-04-15 11:36:59,142 INFO L272 TraceCheckUtils]: 50: Hoare triple {93799#false} call stub_driver_init(); {93932#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {93932#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,143 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {93798#true} {93799#false} #1222#return; {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {93799#false} assume !!(~status~5 >= 0); {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {93799#false} assume !(0 == ~__BLAST_NONDET~0); {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {93799#false} assume !(1 == ~__BLAST_NONDET~0); {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {93799#false} assume !(2 == ~__BLAST_NONDET~0); {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {93799#false} assume 3 == ~__BLAST_NONDET~0; {93799#false} is VALID [2022-04-15 11:36:59,143 INFO L272 TraceCheckUtils]: 59: Hoare triple {93799#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {93933#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {93933#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {93798#true} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {93798#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {93798#true} is VALID [2022-04-15 11:36:59,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {93798#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {93798#true} is VALID [2022-04-15 11:36:59,144 INFO L272 TraceCheckUtils]: 63: Hoare triple {93798#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:36:59,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {93908#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {93798#true} is VALID [2022-04-15 11:36:59,144 INFO L290 TraceCheckUtils]: 65: Hoare triple {93798#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {93798#true} is VALID [2022-04-15 11:36:59,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {93798#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {93798#true} is VALID [2022-04-15 11:36:59,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {93798#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {93798#true} is VALID [2022-04-15 11:36:59,144 INFO L290 TraceCheckUtils]: 68: Hoare triple {93798#true} assume #res.base == dest.base && #res.offset == dest.offset; {93798#true} is VALID [2022-04-15 11:36:59,145 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {93798#true} {93798#true} #1186#return; {93798#true} is VALID [2022-04-15 11:36:59,145 INFO L290 TraceCheckUtils]: 70: Hoare triple {93798#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {93798#true} is VALID [2022-04-15 11:36:59,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {93798#true} assume !(~s~0 != ~NP~0); {93798#true} is VALID [2022-04-15 11:36:59,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {93798#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {93798#true} is VALID [2022-04-15 11:36:59,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {93798#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {93798#true} is VALID [2022-04-15 11:36:59,146 INFO L272 TraceCheckUtils]: 74: Hoare triple {93798#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {93977#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {93977#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {93798#true} assume 0 != ~compRegistered~0; {93798#true} is VALID [2022-04-15 11:36:59,147 INFO L272 TraceCheckUtils]: 77: Hoare triple {93798#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {93798#true} is VALID [2022-04-15 11:36:59,147 INFO L272 TraceCheckUtils]: 79: Hoare triple {93798#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:36:59,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {93989#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93798#true} is VALID [2022-04-15 11:36:59,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {93798#true} {93798#true} #1174#return; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 83: Hoare triple {93798#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 84: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {93798#true} {93798#true} #1210#return; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 86: Hoare triple {93798#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 87: Hoare triple {93798#true} assume -1073741802 == ~compRetStatus~0; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L272 TraceCheckUtils]: 88: Hoare triple {93798#true} call stubMoreProcessingRequired(); {93993#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 89: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L290 TraceCheckUtils]: 90: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,148 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {93798#true} {93798#true} #1212#return; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {93798#true} assume !(0 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 93: Hoare triple {93798#true} assume !(1 == ~__BLAST_NONDET~11); {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {93798#true} ~returnVal2~0 := 259; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {93798#true} assume !(~s~0 == ~NP~0); {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 96: Hoare triple {93798#true} assume ~s~0 == ~MPR1~0; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 97: Hoare triple {93798#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 98: Hoare triple {93798#true} #res := ~returnVal2~0; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 99: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {93798#true} {93798#true} #1192#return; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {93798#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {93798#true} is VALID [2022-04-15 11:36:59,149 INFO L290 TraceCheckUtils]: 102: Hoare triple {93798#true} assume 259 == ~status~3; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L272 TraceCheckUtils]: 103: Hoare triple {93798#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {93994#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {93994#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 105: Hoare triple {93798#true} assume ~s~0 == ~MPR3~0; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 106: Hoare triple {93798#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 107: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~13; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {93798#true} #res := 0; {93798#true} is VALID [2022-04-15 11:36:59,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {93798#true} {93798#true} #1194#return; {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {93798#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {93798#true} assume ~status~3 >= 0; {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {93798#true} assume !(~myStatus~0 >= 0); {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {93798#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L272 TraceCheckUtils]: 115: Hoare triple {93798#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {93993#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 116: Hoare triple {93993#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {93798#true} is VALID [2022-04-15 11:36:59,151 INFO L290 TraceCheckUtils]: 117: Hoare triple {93798#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {93798#true} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 118: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,152 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {93798#true} {93798#true} #1196#return; {93798#true} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 120: Hoare triple {93798#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {93798#true} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 121: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:36:59,152 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {93798#true} {93799#false} #1230#return; {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 123: Hoare triple {93799#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 124: Hoare triple {93799#false} assume 0 != ~we_should_unload~0; {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 125: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 126: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 127: Hoare triple {93799#false} assume !(~s~0 == ~UNLOADED~0); {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 128: Hoare triple {93799#false} assume !(-1 == ~status~5); {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 129: Hoare triple {93799#false} assume ~s~0 != ~SKIP2~0; {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 130: Hoare triple {93799#false} assume ~s~0 != ~IPC~0; {93799#false} is VALID [2022-04-15 11:36:59,152 INFO L290 TraceCheckUtils]: 131: Hoare triple {93799#false} assume !(~s~0 != ~DC~0); {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L290 TraceCheckUtils]: 133: Hoare triple {93799#false} assume ~s~0 == ~DC~0; {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L290 TraceCheckUtils]: 134: Hoare triple {93799#false} assume 259 == ~status~5; {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L272 TraceCheckUtils]: 135: Hoare triple {93799#false} call errorFn(); {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L290 TraceCheckUtils]: 136: Hoare triple {93799#false} assume !false; {93799#false} is VALID [2022-04-15 11:36:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:36:59,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:59,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358035270] [2022-04-15 11:36:59,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358035270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:36:59,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739051717] [2022-04-15 11:36:59,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:36:59,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:36:59,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:36:59,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:36:59,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 11:37:00,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:37:00,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:37:00,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 11:37:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:00,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:37:00,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {93798#true} call ULTIMATE.init(); {93798#true} is VALID [2022-04-15 11:37:00,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {93798#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {93798#true} is VALID [2022-04-15 11:37:00,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93798#true} {93798#true} #1270#return; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {93798#true} call #t~ret213 := main(); {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {93798#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {93798#true} call _BLAST_init(); {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {93798#true} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {93798#true} {93798#true} #1216#return; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L272 TraceCheckUtils]: 10: Hoare triple {93798#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {93798#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L272 TraceCheckUtils]: 12: Hoare triple {93798#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {93798#true} ~cond := #in~cond; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {93798#true} assume !(0 == ~cond); {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {93798#true} {93798#true} #1254#return; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {93798#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {93798#true} {93798#true} #1218#return; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {93798#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {93798#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {93798#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L272 TraceCheckUtils]: 23: Hoare triple {93798#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {93798#true} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L272 TraceCheckUtils]: 25: Hoare triple {93798#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {93798#true} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~5; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {93798#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,927 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {93798#true} {93798#true} #1176#return; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {93798#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {93798#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L272 TraceCheckUtils]: 33: Hoare triple {93798#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {93798#true} #t~loopctr214 := 0; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {93798#true} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {93798#true} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {93798#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {93798#true} {93798#true} #1178#return; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {93798#true} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {93798#true} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {93798#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {93798#true} assume 0 == ~__BLAST_NONDET~2; {93798#true} is VALID [2022-04-15 11:37:00,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {93798#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {93798#true} {93798#true} #1180#return; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {93798#true} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {93798#true} {93798#true} #1220#return; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {93798#true} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L272 TraceCheckUtils]: 50: Hoare triple {93798#true} call stub_driver_init(); {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {93798#true} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {93798#true} is VALID [2022-04-15 11:37:00,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {93798#true} assume true; {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {93798#true} {93798#true} #1222#return; {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {93798#true} assume !!(~status~5 >= 0); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {93798#true} assume !(0 == ~__BLAST_NONDET~0); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {93798#true} assume !(1 == ~__BLAST_NONDET~0); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {93798#true} assume !(2 == ~__BLAST_NONDET~0); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {93798#true} assume 3 == ~__BLAST_NONDET~0; {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L272 TraceCheckUtils]: 59: Hoare triple {93798#true} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 60: Hoare triple {93798#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {93798#true} is VALID [2022-04-15 11:37:00,930 INFO L290 TraceCheckUtils]: 61: Hoare triple {93798#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {93798#true} is VALID [2022-04-15 11:37:00,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {93798#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {93798#true} is VALID [2022-04-15 11:37:00,931 INFO L272 TraceCheckUtils]: 63: Hoare triple {93798#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {93798#true} is VALID [2022-04-15 11:37:00,931 INFO L290 TraceCheckUtils]: 64: Hoare triple {93798#true} #t~loopctr215 := 0; {93798#true} is VALID [2022-04-15 11:37:00,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {93798#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {93798#true} is VALID [2022-04-15 11:37:00,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {93798#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {94196#(= |#Ultimate.C_memmove_#t~loopctr221| 0)} is VALID [2022-04-15 11:37:00,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {94196#(= |#Ultimate.C_memmove_#t~loopctr221| 0)} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {94200#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} is VALID [2022-04-15 11:37:00,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {94200#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} assume #res.base == dest.base && #res.offset == dest.offset; {94200#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} is VALID [2022-04-15 11:37:00,933 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {94200#(not (< 0 (mod |#Ultimate.C_memmove_size| 4294967296)))} {93798#true} #1186#return; {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {93799#false} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {93799#false} assume !(~s~0 != ~NP~0); {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {93799#false} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {93799#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L272 TraceCheckUtils]: 74: Hoare triple {93799#false} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {93799#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {93799#false} assume 0 != ~compRegistered~0; {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L272 TraceCheckUtils]: 77: Hoare triple {93799#false} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {93799#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {93799#false} is VALID [2022-04-15 11:37:00,934 INFO L272 TraceCheckUtils]: 79: Hoare triple {93799#false} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {93799#false} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {93799#false} {93799#false} #1174#return; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {93799#false} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 84: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {93799#false} {93799#false} #1210#return; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {93799#false} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {93799#false} assume -1073741802 == ~compRetStatus~0; {93799#false} is VALID [2022-04-15 11:37:00,935 INFO L272 TraceCheckUtils]: 88: Hoare triple {93799#false} call stubMoreProcessingRequired(); {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 89: Hoare triple {93799#false} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 90: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {93799#false} {93799#false} #1212#return; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 92: Hoare triple {93799#false} assume !(0 == ~__BLAST_NONDET~11); {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {93799#false} assume !(1 == ~__BLAST_NONDET~11); {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {93799#false} ~returnVal2~0 := 259; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {93799#false} assume !(~s~0 == ~NP~0); {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {93799#false} assume ~s~0 == ~MPR1~0; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {93799#false} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {93799#false} is VALID [2022-04-15 11:37:00,936 INFO L290 TraceCheckUtils]: 98: Hoare triple {93799#false} #res := ~returnVal2~0; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 99: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {93799#false} {93799#false} #1192#return; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 101: Hoare triple {93799#false} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 102: Hoare triple {93799#false} assume 259 == ~status~3; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L272 TraceCheckUtils]: 103: Hoare triple {93799#false} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 104: Hoare triple {93799#false} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 105: Hoare triple {93799#false} assume ~s~0 == ~MPR3~0; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 106: Hoare triple {93799#false} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 107: Hoare triple {93799#false} assume 0 == ~__BLAST_NONDET~13; {93799#false} is VALID [2022-04-15 11:37:00,937 INFO L290 TraceCheckUtils]: 108: Hoare triple {93799#false} #res := 0; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 109: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {93799#false} {93799#false} #1194#return; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 111: Hoare triple {93799#false} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 112: Hoare triple {93799#false} assume ~status~3 >= 0; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 113: Hoare triple {93799#false} assume !(~myStatus~0 >= 0); {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 114: Hoare triple {93799#false} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L272 TraceCheckUtils]: 115: Hoare triple {93799#false} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 116: Hoare triple {93799#false} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 117: Hoare triple {93799#false} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {93799#false} is VALID [2022-04-15 11:37:00,938 INFO L290 TraceCheckUtils]: 118: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {93799#false} {93799#false} #1196#return; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 120: Hoare triple {93799#false} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 121: Hoare triple {93799#false} assume true; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {93799#false} {93798#true} #1230#return; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 123: Hoare triple {93799#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 124: Hoare triple {93799#false} assume 0 != ~we_should_unload~0; {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 125: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 126: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 127: Hoare triple {93799#false} assume !(~s~0 == ~UNLOADED~0); {93799#false} is VALID [2022-04-15 11:37:00,939 INFO L290 TraceCheckUtils]: 128: Hoare triple {93799#false} assume !(-1 == ~status~5); {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 129: Hoare triple {93799#false} assume ~s~0 != ~SKIP2~0; {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 130: Hoare triple {93799#false} assume ~s~0 != ~IPC~0; {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 131: Hoare triple {93799#false} assume !(~s~0 != ~DC~0); {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 132: Hoare triple {93799#false} assume !(1 == ~pended~0); {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 133: Hoare triple {93799#false} assume ~s~0 == ~DC~0; {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 134: Hoare triple {93799#false} assume 259 == ~status~5; {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L272 TraceCheckUtils]: 135: Hoare triple {93799#false} call errorFn(); {93799#false} is VALID [2022-04-15 11:37:00,940 INFO L290 TraceCheckUtils]: 136: Hoare triple {93799#false} assume !false; {93799#false} is VALID [2022-04-15 11:37:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:37:00,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:37:00,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739051717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:00,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:37:00,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2022-04-15 11:37:00,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:00,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675533971] [2022-04-15 11:37:00,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675533971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:00,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:00,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844426208] [2022-04-15 11:37:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2022-04-15 11:37:00,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:00,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:37:01,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:01,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-15 11:37:01,071 INFO L87 Difference]: Start difference. First operand 235 states and 250 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:37:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:08,865 INFO L93 Difference]: Finished difference Result 355 states and 376 transitions. [2022-04-15 11:37:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2022-04-15 11:37:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:37:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 11:37:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:37:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 11:37:08,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-15 11:37:09,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:09,025 INFO L225 Difference]: With dead ends: 355 [2022-04-15 11:37:09,025 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 11:37:09,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:37:09,025 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:09,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:37:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 11:37:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-04-15 11:37:09,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:09,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:37:09,623 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:37:09,623 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:37:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:09,626 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2022-04-15 11:37:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 252 transitions. [2022-04-15 11:37:09,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:09,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:09,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 237 states. [2022-04-15 11:37:09,626 INFO L87 Difference]: Start difference. First operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 237 states. [2022-04-15 11:37:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:09,629 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2022-04-15 11:37:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 252 transitions. [2022-04-15 11:37:09,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:09,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:09,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:09,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 177 states have internal predecessors, (192), 31 states have call successors, (31), 31 states have call predecessors, (31), 28 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-15 11:37:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 252 transitions. [2022-04-15 11:37:09,632 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 252 transitions. Word has length 137 [2022-04-15 11:37:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:09,632 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 252 transitions. [2022-04-15 11:37:09,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-15 11:37:09,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 252 transitions. [2022-04-15 11:37:10,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 252 transitions. [2022-04-15 11:37:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 11:37:10,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:10,346 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:10,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 11:37:10,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 11:37:10,547 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1381815261, now seen corresponding path program 1 times [2022-04-15 11:37:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:10,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492103255] [2022-04-15 11:37:10,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:37:10,549 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 11:37:10,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1381815261, now seen corresponding path program 2 times [2022-04-15 11:37:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214017699] [2022-04-15 11:37:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:10,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {96176#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {96067#true} is VALID [2022-04-15 11:37:10,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:10,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96067#true} {96067#true} #1270#return; {96067#true} is VALID [2022-04-15 11:37:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:37:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:10,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {96177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {96067#true} is VALID [2022-04-15 11:37:10,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:10,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96067#true} {96067#true} #1216#return; {96067#true} is VALID [2022-04-15 11:37:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 11:37:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:37:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:10,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {96067#true} ~cond := #in~cond; {96067#true} is VALID [2022-04-15 11:37:10,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume !(0 == ~cond); {96067#true} is VALID [2022-04-15 11:37:10,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:10,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96067#true} {96067#true} #1254#return; {96067#true} is VALID [2022-04-15 11:37:10,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {96067#true} is VALID [2022-04-15 11:37:10,979 INFO L272 TraceCheckUtils]: 1: Hoare triple {96067#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} ~cond := #in~cond; {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume !(0 == ~cond); {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96067#true} {96067#true} #1254#return; {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {96067#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:10,980 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {96067#true} {96067#true} #1218#return; {96067#true} is VALID [2022-04-15 11:37:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 11:37:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:37:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {96067#true} is VALID [2022-04-15 11:37:11,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~5; {96067#true} is VALID [2022-04-15 11:37:11,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {96067#true} is VALID [2022-04-15 11:37:11,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,035 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96067#true} {96067#true} #1176#return; {96067#true} is VALID [2022-04-15 11:37:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 11:37:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:37:11,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:37:11,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,118 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {96067#true} #1178#return; {96068#false} is VALID [2022-04-15 11:37:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 11:37:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {96067#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {96067#true} is VALID [2022-04-15 11:37:11,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~2; {96067#true} is VALID [2022-04-15 11:37:11,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {96067#true} is VALID [2022-04-15 11:37:11,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,124 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96067#true} {96068#false} #1180#return; {96068#false} is VALID [2022-04-15 11:37:11,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L272 TraceCheckUtils]: 1: Hoare triple {96067#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:37:11,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~5; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {96067#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96067#true} {96067#true} #1176#return; {96067#true} is VALID [2022-04-15 11:37:11,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {96067#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {96067#true} is VALID [2022-04-15 11:37:11,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {96067#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,126 INFO L272 TraceCheckUtils]: 9: Hoare triple {96067#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:37:11,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:37:11,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:37:11,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,130 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {96067#true} #1178#return; {96068#false} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {96068#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {96068#false} is VALID [2022-04-15 11:37:11,130 INFO L272 TraceCheckUtils]: 16: Hoare triple {96068#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {96067#true} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {96067#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {96067#true} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~2; {96067#true} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {96067#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {96067#true} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,130 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {96067#true} {96068#false} #1180#return; {96068#false} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {96068#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {96068#false} is VALID [2022-04-15 11:37:11,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {96068#false} assume true; {96068#false} is VALID [2022-04-15 11:37:11,130 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {96068#false} {96067#true} #1220#return; {96068#false} is VALID [2022-04-15 11:37:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 11:37:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {96202#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96067#true} {96068#false} #1222#return; {96068#false} is VALID [2022-04-15 11:37:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-15 11:37:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:37:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {96067#true} is VALID [2022-04-15 11:37:11,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {96067#true} is VALID [2022-04-15 11:37:11,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {96067#true} is VALID [2022-04-15 11:37:11,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume #t~loopctr221 % 4294967296 < size % 4294967296;call #t~mem222.base, #t~mem222.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr221, 4);call write~unchecked~$Pointer$(#t~mem222.base, #t~mem222.offset, dest.base, dest.offset + #t~loopctr221, 4);#t~loopctr221 := 4 + #t~loopctr221; {96067#true} is VALID [2022-04-15 11:37:11,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {96067#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {96067#true} is VALID [2022-04-15 11:37:11,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} assume #res.base == dest.base && #res.offset == dest.offset; {96067#true} is VALID [2022-04-15 11:37:11,229 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96067#true} {96067#true} #1186#return; {96067#true} is VALID [2022-04-15 11:37:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 11:37:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 11:37:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 11:37:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {96067#true} is VALID [2022-04-15 11:37:11,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96067#true} {96067#true} #1174#return; {96067#true} is VALID [2022-04-15 11:37:11,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {96067#true} is VALID [2022-04-15 11:37:11,280 INFO L272 TraceCheckUtils]: 1: Hoare triple {96067#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {96067#true} is VALID [2022-04-15 11:37:11,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,280 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96067#true} {96067#true} #1174#return; {96067#true} is VALID [2022-04-15 11:37:11,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {96067#true} is VALID [2022-04-15 11:37:11,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,281 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96067#true} {96067#true} #1210#return; {96067#true} is VALID [2022-04-15 11:37:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 11:37:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96067#true} {96067#true} #1212#return; {96067#true} is VALID [2022-04-15 11:37:11,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {96248#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume 0 != ~compRegistered~0; {96067#true} is VALID [2022-04-15 11:37:11,305 INFO L272 TraceCheckUtils]: 2: Hoare triple {96067#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {96067#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96067#true} {96067#true} #1174#return; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {96067#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {96067#true} {96067#true} #1210#return; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {96067#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {96067#true} assume -1073741802 == ~compRetStatus~0; {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L272 TraceCheckUtils]: 13: Hoare triple {96067#true} call stubMoreProcessingRequired(); {96264#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:37:11,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96067#true} {96067#true} #1212#return; {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {96067#true} assume !(0 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {96067#true} assume !(1 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {96067#true} ~returnVal2~0 := 259; {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {96067#true} assume !(~s~0 == ~NP~0); {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {96067#true} assume ~s~0 == ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {96067#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {96067#true} #res := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,308 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {96067#true} {96067#true} #1192#return; {96067#true} is VALID [2022-04-15 11:37:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 11:37:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {96265#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {96067#true} is VALID [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume ~s~0 == ~MPR3~0; {96067#true} is VALID [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~13; {96067#true} is VALID [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {96067#true} #res := 0; {96067#true} is VALID [2022-04-15 11:37:11,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,330 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {96067#true} {96067#true} #1194#return; {96067#true} is VALID [2022-04-15 11:37:11,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 11:37:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96067#true} {96067#true} #1196#return; {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {96203#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {96067#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {96067#true} is VALID [2022-04-15 11:37:11,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {96067#true} is VALID [2022-04-15 11:37:11,335 INFO L272 TraceCheckUtils]: 3: Hoare triple {96067#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:37:11,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {96067#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {96067#true} assume #t~loopctr221 % 4294967296 < size % 4294967296;call #t~mem222.base, #t~mem222.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr221, 4);call write~unchecked~$Pointer$(#t~mem222.base, #t~mem222.offset, dest.base, dest.offset + #t~loopctr221, 4);#t~loopctr221 := 4 + #t~loopctr221; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {96067#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {96067#true} assume #res.base == dest.base && #res.offset == dest.offset; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {96067#true} {96067#true} #1186#return; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {96067#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {96067#true} assume !(~s~0 != ~NP~0); {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {96067#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {96067#true} is VALID [2022-04-15 11:37:11,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {96067#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,337 INFO L272 TraceCheckUtils]: 15: Hoare triple {96067#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {96248#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {96248#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {96067#true} assume 0 != ~compRegistered~0; {96067#true} is VALID [2022-04-15 11:37:11,338 INFO L272 TraceCheckUtils]: 18: Hoare triple {96067#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L272 TraceCheckUtils]: 20: Hoare triple {96067#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {96067#true} {96067#true} #1174#return; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {96067#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {96067#true} {96067#true} #1210#return; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {96067#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {96067#true} assume -1073741802 == ~compRetStatus~0; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L272 TraceCheckUtils]: 29: Hoare triple {96067#true} call stubMoreProcessingRequired(); {96264#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {96067#true} {96067#true} #1212#return; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {96067#true} assume !(0 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {96067#true} assume !(1 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {96067#true} ~returnVal2~0 := 259; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {96067#true} assume !(~s~0 == ~NP~0); {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {96067#true} assume ~s~0 == ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {96067#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {96067#true} #res := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {96067#true} {96067#true} #1192#return; {96067#true} is VALID [2022-04-15 11:37:11,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {96067#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {96067#true} is VALID [2022-04-15 11:37:11,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {96067#true} assume 259 == ~status~3; {96067#true} is VALID [2022-04-15 11:37:11,341 INFO L272 TraceCheckUtils]: 44: Hoare triple {96067#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {96265#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {96265#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {96067#true} assume ~s~0 == ~MPR3~0; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {96067#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~13; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {96067#true} #res := 0; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {96067#true} {96067#true} #1194#return; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {96067#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {96067#true} assume ~status~3 >= 0; {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {96067#true} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {96067#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L272 TraceCheckUtils]: 56: Hoare triple {96067#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {96264#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:37:11,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {96067#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {96067#true} {96067#true} #1196#return; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {96067#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,343 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {96067#true} {96068#false} #1230#return; {96068#false} is VALID [2022-04-15 11:37:11,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {96067#true} call ULTIMATE.init(); {96176#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:37:11,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {96176#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96067#true} {96067#true} #1270#return; {96067#true} is VALID [2022-04-15 11:37:11,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {96067#true} call #t~ret213 := main(); {96067#true} is VALID [2022-04-15 11:37:11,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {96067#true} call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(168);call ~#u~0.base, ~#u~0.offset := #Ultimate.allocOnStack(8);havoc ~status~5;assume -2147483648 <= #t~nondet154 && #t~nondet154 <= 2147483647;~we_should_unload~0 := #t~nondet154;havoc #t~nondet154;call ~#irp~0.base, ~#irp~0.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet155 && #t~nondet155 <= 2147483647;~__BLAST_NONDET~0 := #t~nondet155;havoc #t~nondet155;assume -2147483648 <= #t~nondet156 && #t~nondet156 <= 2147483647;~irp_choice~0 := #t~nondet156;havoc #t~nondet156;call ~#devext~0.base, ~#devext~0.offset := #Ultimate.allocOnStack(55);call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(~#devext~0.base, ~#devext~0.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);call ~#ext~0.base, ~#ext~0.offset := #Ultimate.allocOnStack(20);call write~$Pointer$(~#ext~0.base, ~#ext~0.offset, ~#d~0.base, 24 + ~#d~0.offset, 4);call ~#hookkb~0.base, ~#hookkb~0.offset := #Ultimate.allocOnStack(24);call ~#stack~0.base, ~#stack~0.offset := #Ultimate.allocOnStack(108);call write~int(#t~nondet157, ~#stack~0.base, ~#stack~0.offset, 1);havoc #t~nondet157;call write~int(#t~nondet158, ~#stack~0.base, 36 + ~#stack~0.offset, 1);havoc #t~nondet158;call write~int(#t~nondet159, ~#stack~0.base, 72 + ~#stack~0.offset, 1);havoc #t~nondet159;call write~int(#t~nondet160, ~#stack~0.base, 1 + ~#stack~0.offset, 1);havoc #t~nondet160;call write~int(#t~nondet161, ~#stack~0.base, 37 + ~#stack~0.offset, 1);havoc #t~nondet161;call write~int(#t~nondet162, ~#stack~0.base, 73 + ~#stack~0.offset, 1);havoc #t~nondet162;call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 16 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 52 + ~#stack~0.offset, 4);call write~$Pointer$(~#hookkb~0.base, ~#hookkb~0.offset, ~#stack~0.base, 88 + ~#stack~0.offset, 4);call write~int(#t~nondet163, ~#stack~0.base, 8 + ~#stack~0.offset, 4);havoc #t~nondet163;call write~int(#t~nondet164, ~#stack~0.base, 44 + ~#stack~0.offset, 4);havoc #t~nondet164;call write~int(#t~nondet165, ~#stack~0.base, 80 + ~#stack~0.offset, 4);havoc #t~nondet165;call write~int(#t~nondet166, ~#stack~0.base, 12 + ~#stack~0.offset, 4);havoc #t~nondet166;call write~int(#t~nondet167, ~#stack~0.base, 48 + ~#stack~0.offset, 4);havoc #t~nondet167;call write~int(#t~nondet168, ~#stack~0.base, 84 + ~#stack~0.offset, 4);havoc #t~nondet168;call write~$Pointer$(~#stack~0.base, 36 + ~#stack~0.offset, ~#irp~0.base, 96 + ~#irp~0.offset, 4);~pirp~0.base, ~pirp~0.offset := ~#irp~0.base, ~#irp~0.offset; {96067#true} is VALID [2022-04-15 11:37:11,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {96067#true} call _BLAST_init(); {96177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {96177#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,347 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {96067#true} {96067#true} #1216#return; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L272 TraceCheckUtils]: 10: Hoare triple {96067#true} call #t~ret169 := DriverEntry(~#d~0.base, ~#d~0.offset, ~#u~0.base, ~#u~0.offset); {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~RegistryPath.base, ~RegistryPath.offset := #in~RegistryPath.base, #in~RegistryPath.offset;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~i~0 := #t~nondet20;havoc #t~nondet20; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {96067#true} call assume_abort_if_not((if ~i~0 % 4294967296 < 28 then 1 else 0)); {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {96067#true} ~cond := #in~cond; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {96067#true} assume !(0 == ~cond); {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96067#true} {96067#true} #1254#return; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {96067#true} call write~$Pointer$(#funAddr~KbFilter_DispatchPassThrough.base, #funAddr~KbFilter_DispatchPassThrough.offset, ~DriverObject.base, 56 + ~DriverObject.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 56 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_CreateClose.base, #funAddr~KbFilter_CreateClose.offset, ~DriverObject.base, 64 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_PnP.base, #funAddr~KbFilter_PnP.offset, ~DriverObject.base, 164 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Power.base, #funAddr~KbFilter_Power.offset, ~DriverObject.base, 144 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_InternIoCtl.base, #funAddr~KbFilter_InternIoCtl.offset, ~DriverObject.base, 116 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_Unload.base, #funAddr~KbFilter_Unload.offset, ~DriverObject.base, 52 + ~DriverObject.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~DriverObject.base, 24 + ~DriverObject.offset, 4);call write~$Pointer$(#funAddr~KbFilter_AddDevice.base, #funAddr~KbFilter_AddDevice.offset, #t~mem21.base, 4 + #t~mem21.offset, 4);havoc #t~mem21.base, #t~mem21.offset;#res := 0; {96067#true} is VALID [2022-04-15 11:37:11,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,350 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {96067#true} {96067#true} #1218#return; {96067#true} is VALID [2022-04-15 11:37:11,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {96067#true} assume -2147483648 <= #t~ret169 && #t~ret169 <= 2147483647;~status~5 := #t~ret169;havoc #t~ret169; {96067#true} is VALID [2022-04-15 11:37:11,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {96067#true} assume ~status~5 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {96067#true} assume !(0 == ~irp_choice~0); {96067#true} is VALID [2022-04-15 11:37:11,351 INFO L272 TraceCheckUtils]: 23: Hoare triple {96067#true} call #t~ret170 := KbFilter_AddDevice(~#d~0.base, ~#d~0.offset, ~#devobj~0.base, ~#devobj~0.offset); {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:37:11,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~Driver.base, ~Driver.offset := #in~Driver.base, #in~Driver.offset;~PDO.base, ~PDO.offset := #in~PDO.base, #in~PDO.offset;havoc ~devExt~0.base, ~devExt~0.offset;call ~#device~0.base, ~#device~0.offset := #Ultimate.allocOnStack(4);havoc ~status~0;~status~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L272 TraceCheckUtils]: 25: Hoare triple {96067#true} call #t~ret22 := IoCreateDevice(~Driver.base, ~Driver.offset, 55, 0, 0, 11, 0, 0, ~#device~0.base, ~#device~0.offset); {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {96183#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~DriverObject.base, ~DriverObject.offset := #in~DriverObject.base, #in~DriverObject.offset;~DeviceExtensionSize := #in~DeviceExtensionSize;~DeviceName.base, ~DeviceName.offset := #in~DeviceName.base, #in~DeviceName.offset;~DeviceType := #in~DeviceType;~DeviceCharacteristics := #in~DeviceCharacteristics;~Exclusive := #in~Exclusive;~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;assume -2147483648 <= #t~nondet185 && #t~nondet185 <= 2147483647;~__BLAST_NONDET~5 := #t~nondet185;havoc #t~nondet185;havoc ~tmp~8.base, ~tmp~8.offset; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~5; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {96067#true} call #t~malloc186.base, #t~malloc186.offset := #Ultimate.allocOnHeap(175);~tmp~8.base, ~tmp~8.offset := #t~malloc186.base, #t~malloc186.offset;havoc #t~malloc186.base, #t~malloc186.offset;call write~$Pointer$(~tmp~8.base, ~tmp~8.offset, ~DeviceObject.base, ~DeviceObject.offset, 4);call #t~mem187.base, #t~mem187.offset := read~$Pointer$(~DeviceObject.base, ~DeviceObject.offset, 4);call #t~malloc188.base, #t~malloc188.offset := #Ultimate.allocOnHeap(~DeviceExtensionSize);call write~$Pointer$(#t~malloc188.base, #t~malloc188.offset, #t~mem187.base, 40 + #t~mem187.offset, 4);havoc #t~mem187.base, #t~mem187.offset;havoc #t~malloc188.base, #t~malloc188.offset;#res := 0; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {96067#true} {96067#true} #1176#return; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {96067#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~status~0 := #t~ret22;havoc #t~ret22; {96067#true} is VALID [2022-04-15 11:37:11,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {96067#true} assume !!(~status~0 >= 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 40 + #t~mem23.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,353 INFO L272 TraceCheckUtils]: 33: Hoare triple {96067#true} call #t~memset~res25.base, #t~memset~res25.offset := #Ultimate.C_memset(#t~mem24.base, #t~mem24.offset, 0, 55); {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:37:11,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr214 := 0; {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} is VALID [2022-04-15 11:37:11,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {96199#(and (<= 0 |#Ultimate.C_memset_#t~loopctr214|) (<= |#Ultimate.C_memset_#t~loopctr214| 0))} assume #t~loopctr214 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr214 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr214 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr214 := #value];#t~loopctr214 := 1 + #t~loopctr214; {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} is VALID [2022-04-15 11:37:11,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {96200#(and (or (not (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))) (<= |#Ultimate.C_memset_#t~loopctr214| 1)) (or (and (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|) (not (<= (+ (div |#Ultimate.C_memset_#t~loopctr214| 4294967296) 1) 0))) (<= (div |#Ultimate.C_memset_#amount| 4294967296) (div |#Ultimate.C_memset_#t~loopctr214| 4294967296))))} assume !(#t~loopctr214 % 4294967296 < #amount % 4294967296); {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} is VALID [2022-04-15 11:37:11,357 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {96201#(or (<= |#Ultimate.C_memset_#amount| 1) (<= 4294967297 |#Ultimate.C_memset_#amount|))} {96067#true} #1178#return; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {96068#false} havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~memset~res25.base, #t~memset~res25.offset;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem27.base, #t~mem27.offset := read~$Pointer$(#t~mem26.base, 40 + #t~mem26.offset, 4);~devExt~0.base, ~devExt~0.offset := #t~mem27.base, #t~mem27.offset;havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem27.base, #t~mem27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4); {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L272 TraceCheckUtils]: 40: Hoare triple {96068#false} call #t~ret29.base, #t~ret29.offset := IoAttachDeviceToDeviceStack(#t~mem28.base, #t~mem28.offset, ~PDO.base, ~PDO.offset); {96067#true} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {96067#true} ~SourceDevice.base, ~SourceDevice.offset := #in~SourceDevice.base, #in~SourceDevice.offset;~TargetDevice.base, ~TargetDevice.offset := #in~TargetDevice.base, #in~TargetDevice.offset;assume -2147483648 <= #t~nondet180 && #t~nondet180 <= 2147483647;~__BLAST_NONDET~2 := #t~nondet180;havoc #t~nondet180; {96067#true} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~2; {96067#true} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {96067#true} #res.base, #res.offset := ~TargetDevice.base, ~TargetDevice.offset; {96067#true} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,357 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {96067#true} {96068#false} #1180#return; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {96068#false} call write~$Pointer$(#t~ret29.base, #t~ret29.offset, ~devExt~0.base, 8 + ~devExt~0.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~ret29.base, #t~ret29.offset;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call write~$Pointer$(#t~mem30.base, #t~mem30.offset, ~devExt~0.base, ~devExt~0.offset, 4);havoc #t~mem30.base, #t~mem30.offset;call write~$Pointer$(~PDO.base, ~PDO.offset, ~devExt~0.base, 4 + ~devExt~0.offset, 4);call write~int(1, ~devExt~0.base, 48 + ~devExt~0.offset, 4);call write~int(0, ~devExt~0.base, 53 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 54 + ~devExt~0.offset, 1);call write~int(0, ~devExt~0.base, 52 + ~devExt~0.offset, 1);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem32 := read~int(#t~mem31.base, 28 + #t~mem31.offset, 4);call write~int(~bitwiseOr(#t~mem32, 8196), #t~mem31.base, 28 + #t~mem31.offset, 4);havoc #t~mem31.base, #t~mem31.offset;havoc #t~mem32;call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~#device~0.base, ~#device~0.offset, 4);call #t~mem34 := read~int(#t~mem33.base, 28 + #t~mem33.offset, 4);call write~int((if 0 == #t~mem34 then 0 else (if 1 == #t~mem34 then 1 else ~bitwiseAnd(#t~mem34, 4294967167))), #t~mem33.base, 28 + #t~mem33.offset, 4);havoc #t~mem33.base, #t~mem33.offset;havoc #t~mem34;#res := ~status~0;call ULTIMATE.dealloc(~#device~0.base, ~#device~0.offset);havoc ~#device~0.base, ~#device~0.offset; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {96068#false} assume true; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {96068#false} {96067#true} #1220#return; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {96068#false} assume -2147483648 <= #t~ret170 && #t~ret170 <= 2147483647;~status~5 := #t~ret170;havoc #t~ret170; {96068#false} is VALID [2022-04-15 11:37:11,357 INFO L272 TraceCheckUtils]: 50: Hoare triple {96068#false} call stub_driver_init(); {96202#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {96202#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,358 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {96067#true} {96068#false} #1222#return; {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {96068#false} assume !!(~status~5 >= 0); {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {96068#false} assume !(0 == ~__BLAST_NONDET~0); {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {96068#false} assume !(1 == ~__BLAST_NONDET~0); {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {96068#false} assume !(2 == ~__BLAST_NONDET~0); {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {96068#false} assume 3 == ~__BLAST_NONDET~0; {96068#false} is VALID [2022-04-15 11:37:11,358 INFO L272 TraceCheckUtils]: 59: Hoare triple {96068#false} call #t~ret174 := KbFilter_PnP(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {96203#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {96203#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(#length)| |#length|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(#valid)| |#valid|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~devExt~3.base, ~devExt~3.offset;havoc ~irpStack~3.base, ~irpStack~3.offset;havoc ~status~3;call ~#event~1.base, ~#event~1.offset := #Ultimate.allocOnStack(16);havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;~status~3 := 0;call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~devExt~3.base, ~devExt~3.offset := #t~mem79.base, #t~mem79.offset;havoc #t~mem79.base, #t~mem79.offset;call #t~mem80.base, #t~mem80.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpStack~3.base, ~irpStack~3.offset := #t~mem80.base, #t~mem80.offset;havoc #t~mem80.base, #t~mem80.offset;call #t~mem81 := read~int(~irpStack~3.base, 1 + ~irpStack~3.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {96067#true} assume 0 == #t~mem81 % 256;havoc #t~mem81; {96067#true} is VALID [2022-04-15 11:37:11,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {96067#true} call #t~mem102.base, #t~mem102.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem102.base, #t~mem102.offset;havoc #t~mem102.base, #t~mem102.offset;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem103.base, #t~mem103.offset - 36;havoc #t~mem103.base, #t~mem103.offset; {96067#true} is VALID [2022-04-15 11:37:11,359 INFO L272 TraceCheckUtils]: 63: Hoare triple {96067#true} call #t~memmove~res104.base, #t~memmove~res104.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~0.base, ~irpSp~0.offset, 28); {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:37:11,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {96178#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr215 := 0; {96067#true} is VALID [2022-04-15 11:37:11,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {96067#true} assume #t~loopctr215 % 4294967296 < size % 4294967296;call #t~mem216 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem216, dest.base, dest.offset + #t~loopctr215, 1);call #t~mem217 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem217, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem218 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem218, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem219 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 4);call write~unchecked~int(#t~mem219, dest.base, dest.offset + #t~loopctr215, 4);call #t~mem220 := read~unchecked~int(src.base, src.offset + #t~loopctr215, 1);call write~unchecked~int(#t~mem220, dest.base, dest.offset + #t~loopctr215, 1);#t~loopctr215 := 1 + #t~loopctr215; {96067#true} is VALID [2022-04-15 11:37:11,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {96067#true} assume !(#t~loopctr215 % 4294967296 < size % 4294967296);#t~loopctr221 := 0; {96067#true} is VALID [2022-04-15 11:37:11,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {96067#true} assume #t~loopctr221 % 4294967296 < size % 4294967296;call #t~mem222.base, #t~mem222.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr221, 4);call write~unchecked~$Pointer$(#t~mem222.base, #t~mem222.offset, dest.base, dest.offset + #t~loopctr221, 4);#t~loopctr221 := 4 + #t~loopctr221; {96067#true} is VALID [2022-04-15 11:37:11,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {96067#true} assume !(#t~loopctr221 % 4294967296 < size % 4294967296); {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {96067#true} assume #res.base == dest.base && #res.offset == dest.offset; {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {96067#true} {96067#true} #1186#return; {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L290 TraceCheckUtils]: 71: Hoare triple {96067#true} havoc #t~memmove~res104.base, #t~memmove~res104.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {96067#true} assume !(~s~0 != ~NP~0); {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {96067#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset; {96067#true} is VALID [2022-04-15 11:37:11,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {96067#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem105.base, #t~mem105.offset - 36;havoc #t~mem105.base, #t~mem105.offset;call write~$Pointer$(#funAddr~KbFilter_Complete.base, #funAddr~KbFilter_Complete.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~#event~1.base, ~#event~1.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem106 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem106 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem106;call #t~mem107 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem107 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem107;call #t~mem108.base, #t~mem108.offset := read~$Pointer$(~devExt~3.base, 8 + ~devExt~3.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,361 INFO L272 TraceCheckUtils]: 75: Hoare triple {96067#true} call #t~ret109 := IofCallDriver(#t~mem108.base, #t~mem108.offset, ~Irp.base, ~Irp.offset); {96248#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {96248#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet195 && #t~nondet195 <= 2147483647;~__BLAST_NONDET~11 := #t~nondet195;havoc #t~nondet195;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {96067#true} assume 0 != ~compRegistered~0; {96067#true} is VALID [2022-04-15 11:37:11,362 INFO L272 TraceCheckUtils]: 78: Hoare triple {96067#true} call #t~ret196 := KbFilter_Complete(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset;havoc ~event~0.base, ~event~0.offset;~event~0.base, ~event~0.offset := ~Context.base, ~Context.offset; {96067#true} is VALID [2022-04-15 11:37:11,362 INFO L272 TraceCheckUtils]: 80: Hoare triple {96067#true} call #t~ret35 := KeSetEvent(~event~0.base, ~event~0.offset, 0, 0); {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 11:37:11,362 INFO L290 TraceCheckUtils]: 81: Hoare triple {96260#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event.base, ~Event.offset := #in~Event.base, #in~Event.offset;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet199 && #t~nondet199 <= 2147483647;~l~0 := #t~nondet199;havoc #t~nondet199;~setEventCalled~0 := 1;#res := ~l~0; {96067#true} is VALID [2022-04-15 11:37:11,362 INFO L290 TraceCheckUtils]: 82: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {96067#true} {96067#true} #1174#return; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 84: Hoare triple {96067#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;havoc #t~ret35;#res := -1073741802; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {96067#true} {96067#true} #1210#return; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {96067#true} assume -2147483648 <= #t~ret196 && #t~ret196 <= 2147483647;~tmp~10 := #t~ret196;havoc #t~ret196;~compRetStatus~0 := ~tmp~10; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 88: Hoare triple {96067#true} assume -1073741802 == ~compRetStatus~0; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L272 TraceCheckUtils]: 89: Hoare triple {96067#true} call stubMoreProcessingRequired(); {96264#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L290 TraceCheckUtils]: 91: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,363 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {96067#true} {96067#true} #1212#return; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 93: Hoare triple {96067#true} assume !(0 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {96067#true} assume !(1 == ~__BLAST_NONDET~11); {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 95: Hoare triple {96067#true} ~returnVal2~0 := 259; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 96: Hoare triple {96067#true} assume !(~s~0 == ~NP~0); {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 97: Hoare triple {96067#true} assume ~s~0 == ~MPR1~0; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 98: Hoare triple {96067#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {96067#true} #res := ~returnVal2~0; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {96067#true} {96067#true} #1192#return; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 102: Hoare triple {96067#true} assume -2147483648 <= #t~ret109 && #t~ret109 <= 2147483647;~status~3 := #t~ret109;havoc #t~mem108.base, #t~mem108.offset;havoc #t~ret109; {96067#true} is VALID [2022-04-15 11:37:11,364 INFO L290 TraceCheckUtils]: 103: Hoare triple {96067#true} assume 259 == ~status~3; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L272 TraceCheckUtils]: 104: Hoare triple {96067#true} call #t~ret110 := KeWaitForSingleObject(~#event~1.base, ~#event~1.offset, 0, 0, 0, 0, 0); {96265#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {96265#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet200 && #t~nondet200 <= 2147483647;~__BLAST_NONDET~13 := #t~nondet200;havoc #t~nondet200; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 106: Hoare triple {96067#true} assume ~s~0 == ~MPR3~0; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 107: Hoare triple {96067#true} assume 1 == ~setEventCalled~0;~s~0 := ~NP~0;~setEventCalled~0 := 0; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 108: Hoare triple {96067#true} assume 0 == ~__BLAST_NONDET~13; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 109: Hoare triple {96067#true} #res := 0; {96067#true} is VALID [2022-04-15 11:37:11,365 INFO L290 TraceCheckUtils]: 110: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {96067#true} {96067#true} #1194#return; {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 112: Hoare triple {96067#true} assume -2147483648 <= #t~ret110 && #t~ret110 <= 2147483647;havoc #t~ret110; {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 113: Hoare triple {96067#true} assume ~status~3 >= 0; {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {96067#true} assume ~myStatus~0 >= 0;call write~int(1, ~devExt~3.base, 52 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 54 + ~devExt~3.offset, 1);call write~int(0, ~devExt~3.base, 53 + ~devExt~3.offset, 1); {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {96067#true} call write~int(~status~3, ~Irp.base, 24 + ~Irp.offset, 4);~myStatus~0 := ~status~3;call write~int(0, ~Irp.base, 28 + ~Irp.offset, 4); {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L272 TraceCheckUtils]: 116: Hoare triple {96067#true} call IofCompleteRequest(~Irp.base, ~Irp.offset, 0); {96264#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 117: Hoare triple {96264#(= ~s~0 |old(~s~0)|)} ~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~PriorityBoost := #in~PriorityBoost; {96067#true} is VALID [2022-04-15 11:37:11,366 INFO L290 TraceCheckUtils]: 118: Hoare triple {96067#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {96067#true} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 119: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,367 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {96067#true} {96067#true} #1196#return; {96067#true} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {96067#true} #res := ~status~3;call ULTIMATE.dealloc(~#event~1.base, ~#event~1.offset);havoc ~#event~1.base, ~#event~1.offset; {96067#true} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 122: Hoare triple {96067#true} assume true; {96067#true} is VALID [2022-04-15 11:37:11,367 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {96067#true} {96068#false} #1230#return; {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 124: Hoare triple {96068#false} assume -2147483648 <= #t~ret174 && #t~ret174 <= 2147483647;~status~5 := #t~ret174;havoc #t~ret174; {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 125: Hoare triple {96068#false} assume 0 != ~we_should_unload~0; {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 126: Hoare triple {96068#false} assume !(1 == ~pended~0); {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 127: Hoare triple {96068#false} assume !(1 == ~pended~0); {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 128: Hoare triple {96068#false} assume !(~s~0 == ~UNLOADED~0); {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 129: Hoare triple {96068#false} assume !(-1 == ~status~5); {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 130: Hoare triple {96068#false} assume ~s~0 != ~SKIP2~0; {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 131: Hoare triple {96068#false} assume ~s~0 != ~IPC~0; {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 132: Hoare triple {96068#false} assume !(~s~0 != ~DC~0); {96068#false} is VALID [2022-04-15 11:37:11,367 INFO L290 TraceCheckUtils]: 133: Hoare triple {96068#false} assume !(1 == ~pended~0); {96068#false} is VALID [2022-04-15 11:37:11,368 INFO L290 TraceCheckUtils]: 134: Hoare triple {96068#false} assume ~s~0 == ~DC~0; {96068#false} is VALID [2022-04-15 11:37:11,368 INFO L290 TraceCheckUtils]: 135: Hoare triple {96068#false} assume 259 == ~status~5; {96068#false} is VALID [2022-04-15 11:37:11,368 INFO L272 TraceCheckUtils]: 136: Hoare triple {96068#false} call errorFn(); {96068#false} is VALID [2022-04-15 11:37:11,368 INFO L290 TraceCheckUtils]: 137: Hoare triple {96068#false} assume !false; {96068#false} is VALID [2022-04-15 11:37:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:37:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:11,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214017699] [2022-04-15 11:37:11,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214017699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:37:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437139103] [2022-04-15 11:37:11,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:37:11,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:37:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:37:11,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:37:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process