/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/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:24:26,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:24:26,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:24:27,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:24:27,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:24:27,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:24:27,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:24:27,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:24:27,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:24:27,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:24:27,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:24:27,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:24:27,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:24:27,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:24:27,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:24:27,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:24:27,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:24:27,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:24:27,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:24:27,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:24:27,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:24:27,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:24:27,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:24:27,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:24:27,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:24:27,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:24:27,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:24:27,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:24:27,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:24:27,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:24:27,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:24:27,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:24:27,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:24:27,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:24:27,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:24:27,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:24:27,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:24:27,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:24:27,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:24:27,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:24:27,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:24:27,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:24:27,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:24:27,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:24:27,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:24:27,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:24:27,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:24:27,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:24:27,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:24:27,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:24:27,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:24:27,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:24:27,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:24:27,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:24:27,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:24:27,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:24:27,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:24:27,088 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:24:27,088 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:24:27,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:24:27,088 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:24:27,088 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-08 08:24:27,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:24:27,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:24:27,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:24:27,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:24:27,291 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:24:27,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-08 08:24:27,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf18e2dc/decdf4e81ad9451cb8bbf8a02783313d/FLAGc4661b472 [2022-04-08 08:24:27,941 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:24:27,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-08 08:24:27,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf18e2dc/decdf4e81ad9451cb8bbf8a02783313d/FLAGc4661b472 [2022-04-08 08:24:28,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf18e2dc/decdf4e81ad9451cb8bbf8a02783313d [2022-04-08 08:24:28,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:24:28,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:24:28,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:24:28,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:24:28,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:24:28,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:24:28" (1/1) ... [2022-04-08 08:24:28,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66402214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:28, skipping insertion in model container [2022-04-08 08:24:28,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:24:28" (1/1) ... [2022-04-08 08:24:28,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:24:28,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:24:28,676 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/cdaudio.i.cil-2.c[90200,90213] [2022-04-08 08:24:29,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:24:29,203 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:24:29,257 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/cdaudio.i.cil-2.c[90200,90213] [2022-04-08 08:24:29,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:24:29,516 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:24:29,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29 WrapperNode [2022-04-08 08:24:29,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:24:29,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:24:29,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:24:29,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:24:29,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:24:29,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:24:29,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:24:29,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:24:29,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (1/1) ... [2022-04-08 08:24:29,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:24:29,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:24:29,864 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-08 08:24:29,871 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-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-08 08:24:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-08 08:24:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-08 08:24:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-08 08:24:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-08 08:24:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-08 08:24:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-08 08:24:29,899 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-08 08:24:29,900 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-08 08:24:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-08 08:24:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-08 08:24:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-08 08:24:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-08 08:24:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-08 08:24:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-08 08:24:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-08 08:24:29,905 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-08 08:24:29,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-08 08:24:29,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-08 08:24:29,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:24:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-08 08:24:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:24:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-08 08:24:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-08 08:24:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-08 08:24:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-08 08:24:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-08 08:24:29,912 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-08 08:24:29,912 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-08 08:24:29,916 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-08 08:24:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-08 08:24:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:24:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:24:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:24:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:24:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:24:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:24:30,479 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:24:30,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:24:30,513 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:30,550 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:30,550 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:30,551 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:30,567 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:30,567 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:30,574 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:30,586 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:30,586 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:30,586 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:30,621 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:30,621 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:30,627 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:33,103 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 08:24:33,103 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 08:24:33,120 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:33,127 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:33,127 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:33,128 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:33,134 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:33,135 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:33,135 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:33,149 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:33,149 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:33,150 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:33,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:33,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:33,175 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,716 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:24:36,716 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:24:36,719 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,832 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-08 08:24:36,832 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-08 08:24:36,854 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,859 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:36,859 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:36,859 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-08 08:24:36,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-08 08:24:36,879 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:36,885 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:36,885 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,890 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:36,891 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:36,911 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,917 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:36,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:36,919 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:36,923 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:36,924 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:37,237 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:40,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:24:40,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:24:40,679 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,144 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-08 08:24:47,144 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-08 08:24:47,153 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-08 08:24:47,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-08 08:24:47,188 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,192 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:47,192 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:47,233 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,292 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-08 08:24:47,293 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-08 08:24:47,384 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,388 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:47,388 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:47,567 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:47,571 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:47,571 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:47,572 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:51,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 08:24:51,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 08:24:51,811 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:51,827 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-08 08:24:51,827 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-08 08:24:51,835 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:51,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-08 08:24:51,843 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-08 08:24:51,905 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:51,909 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:51,909 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:52,258 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:52,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-08 08:24:52,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-08 08:24:52,296 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-08 08:24:52,296 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:52,300 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:24:52,300 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:24:52,352 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:24:59,317 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:24:59,317 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:24:59,370 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:24:59,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:24:59,383 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-04-08 08:24:59,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:24:59 BoogieIcfgContainer [2022-04-08 08:24:59,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:24:59,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:24:59,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:24:59,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:24:59,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:24:28" (1/3) ... [2022-04-08 08:24:59,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377cd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:24:59, skipping insertion in model container [2022-04-08 08:24:59,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:24:29" (2/3) ... [2022-04-08 08:24:59,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377cd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:24:59, skipping insertion in model container [2022-04-08 08:24:59,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:24:59" (3/3) ... [2022-04-08 08:24:59,397 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-04-08 08:24:59,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:24:59,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:24:59,431 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:24:59,435 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-08 08:24:59,435 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:24:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-08 08:24:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:24:59,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:24:59,487 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] [2022-04-08 08:24:59,487 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:24:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:24:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 1 times [2022-04-08 08:24:59,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:59,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824494756] [2022-04-08 08:24:59,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:24:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 2 times [2022-04-08 08:24:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:24:59,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075298787] [2022-04-08 08:24:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:24:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:24:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:24:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:59,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-08 08:24:59,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-08 08:24:59,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-08 08:24:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:24:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:59,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {1266#(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; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {1256#true} call ULTIMATE.init(); {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:24:59,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-08 08:24:59,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-08 08:24:59,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-08 08:24:59,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {1256#true} call #t~ret1013 := main(); {1256#true} is VALID [2022-04-08 08:24:59,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1256#true} is VALID [2022-04-08 08:24:59,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {1256#true} call _BLAST_init(); {1266#(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-08 08:24:59,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(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; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,977 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:24:59,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1257#false} is VALID [2022-04-08 08:24:59,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#false} assume !(-1 == ~status~15); {1257#false} is VALID [2022-04-08 08:24:59,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#false} assume !(~s~0 != ~SKIP2~0); {1257#false} is VALID [2022-04-08 08:24:59,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#false} assume 1 == ~pended~0; {1257#false} is VALID [2022-04-08 08:24:59,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#false} assume 259 != ~status~15; {1257#false} is VALID [2022-04-08 08:24:59,980 INFO L272 TraceCheckUtils]: 18: Hoare triple {1257#false} call errorFn(); {1257#false} is VALID [2022-04-08 08:24:59,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-04-08 08:24:59,981 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-08 08:24:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:24:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075298787] [2022-04-08 08:24:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075298787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:59,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:24:59,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:24:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824494756] [2022-04-08 08:24:59,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824494756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:59,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:59,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:24:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408834419] [2022-04-08 08:24:59,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:24:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-08 08:24:59,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:24:59,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:25:00,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:00,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:25:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:25:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:25:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:25:00,049 INFO L87 Difference]: Start difference. First operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:25:09,737 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-08 08:25:16,286 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-08 08:25:23,369 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-08 08:25:34,556 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-08 08:25:37,057 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-08 08:25:39,265 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-08 08:25:43,773 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-08 08:25:46,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:48,440 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-08 08:25:53,937 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-08 08:25:55,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:58,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:02,092 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-08 08:26:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:02,774 INFO L93 Difference]: Finished difference Result 1365 states and 2147 transitions. [2022-04-08 08:26:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:26:02,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-08 08:26:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:26:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:26:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-08 08:26:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:26:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-08 08:26:02,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2147 transitions. [2022-04-08 08:26:05,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:05,227 INFO L225 Difference]: With dead ends: 1365 [2022-04-08 08:26:05,227 INFO L226 Difference]: Without dead ends: 834 [2022-04-08 08:26:05,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:26:05,238 INFO L913 BasicCegarLoop]: 920 mSDtfsCounter, 460 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 187 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:26:05,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1300 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1970 Invalid, 10 Unknown, 0 Unchecked, 31.6s Time] [2022-04-08 08:26:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-08 08:26:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 671. [2022-04-08 08:26:05,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:26:05,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:26:05,350 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:26:05,351 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:26:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:05,436 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-08 08:26:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-08 08:26:05,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:05,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:05,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-08 08:26:05,449 INFO L87 Difference]: Start difference. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-08 08:26:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:05,484 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-08 08:26:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-08 08:26:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:05,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:05,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:26:05,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:26:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:26:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 980 transitions. [2022-04-08 08:26:05,521 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 980 transitions. Word has length 20 [2022-04-08 08:26:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:26:05,522 INFO L478 AbstractCegarLoop]: Abstraction has 671 states and 980 transitions. [2022-04-08 08:26:05,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:26:05,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 671 states and 980 transitions. [2022-04-08 08:26:06,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 980 edges. 980 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 980 transitions. [2022-04-08 08:26:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:26:06,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:26:06,542 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] [2022-04-08 08:26:06,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:26:06,543 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:26:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:26:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 1 times [2022-04-08 08:26:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:06,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910063057] [2022-04-08 08:26:06,552 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:26:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 2 times [2022-04-08 08:26:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:26:06,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540985765] [2022-04-08 08:26:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:26:06,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:26:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:26:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:06,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-08 08:26:06,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 08:26:06,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-08 08:26:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:26:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:06,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {7027#(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; {7014#true} is VALID [2022-04-08 08:26:06,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 08:26:06,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-08 08:26:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:26:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:06,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(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;~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; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {7014#true} call ULTIMATE.init(); {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:26:06,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-08 08:26:06,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 08:26:06,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-08 08:26:06,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {7014#true} call #t~ret1013 := main(); {7014#true} is VALID [2022-04-08 08:26:06,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {7014#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7014#true} is VALID [2022-04-08 08:26:06,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {7014#true} call _BLAST_init(); {7027#(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-08 08:26:06,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(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; {7014#true} is VALID [2022-04-08 08:26:06,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 08:26:06,791 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-08 08:26:06,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {7014#true} assume ~status~15 >= 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; {7014#true} is VALID [2022-04-08 08:26:06,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {7014#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {7014#true} is VALID [2022-04-08 08:26:06,792 INFO L272 TraceCheckUtils]: 12: Hoare triple {7014#true} call stub_driver_init(); {7028#(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-08 08:26:06,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {7028#(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;~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; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {7025#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,798 INFO L272 TraceCheckUtils]: 20: Hoare triple {7025#(= ~s~0 ~NP~0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {7025#(= ~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 ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:06,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7015#false} is VALID [2022-04-08 08:26:06,799 INFO L272 TraceCheckUtils]: 23: Hoare triple {7015#false} call errorFn(); {7015#false} is VALID [2022-04-08 08:26:06,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {7015#false} assume !false; {7015#false} is VALID [2022-04-08 08:26:06,800 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-08 08:26:06,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:26:06,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540985765] [2022-04-08 08:26:06,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540985765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:06,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:06,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:26:06,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:26:06,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910063057] [2022-04-08 08:26:06,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910063057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:06,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:06,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:26:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110317043] [2022-04-08 08:26:06,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:26:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-08 08:26:06,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:26:06,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:26:06,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:06,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:26:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:26:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:26:06,827 INFO L87 Difference]: Start difference. First operand 671 states and 980 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:26:20,944 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-08 08:26:22,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:38,981 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-08 08:26:42,483 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-08 08:26:45,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:47,894 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-08 08:26:51,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:54,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:56,152 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-08 08:27:02,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:02,876 INFO L93 Difference]: Finished difference Result 1451 states and 2142 transitions. [2022-04-08 08:27:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:27:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-08 08:27:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:27:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-08 08:27:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-08 08:27:02,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2142 transitions. [2022-04-08 08:27:05,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2142 edges. 2142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:05,231 INFO L225 Difference]: With dead ends: 1451 [2022-04-08 08:27:05,231 INFO L226 Difference]: Without dead ends: 1173 [2022-04-08 08:27:05,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:27:05,235 INFO L913 BasicCegarLoop]: 1183 mSDtfsCounter, 1930 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 573 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:27:05,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1968 Valid, 1906 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1762 Invalid, 6 Unknown, 0 Unchecked, 26.1s Time] [2022-04-08 08:27:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-04-08 08:27:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 983. [2022-04-08 08:27:05,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:27:05,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:27:05,307 INFO L74 IsIncluded]: Start isIncluded. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:27:05,308 INFO L87 Difference]: Start difference. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:27:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:05,355 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-08 08:27:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-08 08:27:05,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:05,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:05,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-08 08:27:05,362 INFO L87 Difference]: Start difference. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-08 08:27:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:05,409 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-08 08:27:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-08 08:27:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:05,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:27:05,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:27:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:27:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1437 transitions. [2022-04-08 08:27:05,464 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1437 transitions. Word has length 25 [2022-04-08 08:27:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:27:05,464 INFO L478 AbstractCegarLoop]: Abstraction has 983 states and 1437 transitions. [2022-04-08 08:27:05,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:05,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 983 states and 1437 transitions. [2022-04-08 08:27:07,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1437 transitions. [2022-04-08 08:27:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:27:07,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:27:07,232 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] [2022-04-08 08:27:07,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:27:07,233 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:27:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:27:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 1 times [2022-04-08 08:27:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897190481] [2022-04-08 08:27:07,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:27:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 2 times [2022-04-08 08:27:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:27:07,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538699590] [2022-04-08 08:27:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:27:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:27:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:27:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:07,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-08 08:27:07,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-08 08:27:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:27:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:07,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {14264#(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; {14251#true} is VALID [2022-04-08 08:27:07,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-08 08:27:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:27:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:07,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {14265#(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;~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; {14251#true} is VALID [2022-04-08 08:27:07,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-08 08:27:07,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {14251#true} call ULTIMATE.init(); {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:27:07,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-08 08:27:07,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-08 08:27:07,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {14251#true} call #t~ret1013 := main(); {14251#true} is VALID [2022-04-08 08:27:07,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {14251#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14251#true} is VALID [2022-04-08 08:27:07,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {14251#true} call _BLAST_init(); {14264#(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-08 08:27:07,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {14264#(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; {14251#true} is VALID [2022-04-08 08:27:07,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,473 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-08 08:27:07,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {14251#true} assume ~status~15 >= 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; {14251#true} is VALID [2022-04-08 08:27:07,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {14251#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {14251#true} is VALID [2022-04-08 08:27:07,473 INFO L272 TraceCheckUtils]: 12: Hoare triple {14251#true} call stub_driver_init(); {14265#(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-08 08:27:07,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(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;~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; {14251#true} is VALID [2022-04-08 08:27:07,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 08:27:07,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-08 08:27:07,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {14251#true} assume !!(~status~15 >= 0); {14251#true} is VALID [2022-04-08 08:27:07,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {14251#true} assume !(2 == ~__BLAST_NONDET___0~0); {14251#true} is VALID [2022-04-08 08:27:07,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {14251#true} assume 3 == ~__BLAST_NONDET___0~0; {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L272 TraceCheckUtils]: 19: Hoare triple {14251#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {14251#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {14251#true} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {14251#true} assume 22 == #t~mem134 % 256;havoc #t~mem134; {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {14251#true} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {14251#true} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {14251#true} is VALID [2022-04-08 08:27:07,475 INFO L272 TraceCheckUtils]: 25: Hoare triple {14251#true} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14251#true} is VALID [2022-04-08 08:27:07,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {14251#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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {14251#true} is VALID [2022-04-08 08:27:07,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {14251#true} assume !(~s~0 == ~MPR3~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:27:07,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:27:07,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14252#false} is VALID [2022-04-08 08:27:07,478 INFO L272 TraceCheckUtils]: 30: Hoare triple {14252#false} call errorFn(); {14252#false} is VALID [2022-04-08 08:27:07,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {14252#false} assume !false; {14252#false} is VALID [2022-04-08 08:27:07,478 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-08 08:27:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:27:07,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538699590] [2022-04-08 08:27:07,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538699590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:07,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:07,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:27:07,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:27:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897190481] [2022-04-08 08:27:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897190481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:07,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:27:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049922941] [2022-04-08 08:27:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:27:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-08 08:27:07,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:27:07,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:07,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:07,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:27:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:27:07,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:27:07,506 INFO L87 Difference]: Start difference. First operand 983 states and 1437 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:24,286 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-08 08:27:29,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:32,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-08 08:27:37,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:40,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:42,382 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-08 08:27:49,456 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-08 08:27:56,125 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-08 08:28:03,670 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-08 08:28:07,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:14,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:16,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:18,294 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-08 08:28:22,898 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-08 08:28:28,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:30,360 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-08 08:28:32,384 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-08 08:28:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:35,428 INFO L93 Difference]: Finished difference Result 2287 states and 3438 transitions. [2022-04-08 08:28:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:28:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-08 08:28:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:28:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-08 08:28:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-08 08:28:35,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2358 transitions. [2022-04-08 08:28:38,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2358 edges. 2358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:38,271 INFO L225 Difference]: With dead ends: 2287 [2022-04-08 08:28:38,271 INFO L226 Difference]: Without dead ends: 1830 [2022-04-08 08:28:38,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:28:38,273 INFO L913 BasicCegarLoop]: 1374 mSDtfsCounter, 1545 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 516 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:28:38,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 2171 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2317 Invalid, 10 Unknown, 0 Unchecked, 40.3s Time] [2022-04-08 08:28:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-04-08 08:28:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1164. [2022-04-08 08:28:38,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:28:38,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:28:38,367 INFO L74 IsIncluded]: Start isIncluded. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:28:38,386 INFO L87 Difference]: Start difference. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:28:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:38,488 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-08 08:28:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-08 08:28:38,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:28:38,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:28:38,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-08 08:28:38,497 INFO L87 Difference]: Start difference. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-08 08:28:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:38,599 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-08 08:28:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-08 08:28:38,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:28:38,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:28:38,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:28:38,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:28:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:28:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1722 transitions. [2022-04-08 08:28:38,684 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1722 transitions. Word has length 32 [2022-04-08 08:28:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:28:38,684 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1722 transitions. [2022-04-08 08:28:38,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:38,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1722 transitions. [2022-04-08 08:28:41,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1722 transitions. [2022-04-08 08:28:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:28:41,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:28:41,060 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] [2022-04-08 08:28:41,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:28:41,060 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:28:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:28:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 1 times [2022-04-08 08:28:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:28:41,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213129496] [2022-04-08 08:28:41,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:28:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 2 times [2022-04-08 08:28:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:28:41,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562971786] [2022-04-08 08:28:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:28:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:28:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:28:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:41,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-08 08:28:41,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-08 08:28:41,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-08 08:28:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:28:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:41,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {24849#(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; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:28:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:28:41,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(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;~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; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:28:41,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:28:41,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {24835#true} call ULTIMATE.init(); {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:28:41,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-08 08:28:41,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-08 08:28:41,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-08 08:28:41,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {24835#true} call #t~ret1013 := main(); {24835#true} is VALID [2022-04-08 08:28:41,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {24835#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {24835#true} is VALID [2022-04-08 08:28:41,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {24835#true} call _BLAST_init(); {24849#(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-08 08:28:41,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#(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; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,344 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 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; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:28:41,355 INFO L272 TraceCheckUtils]: 12: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {24850#(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-08 08:28:41,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {24850#(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;~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; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:28:41,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:28:41,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem134 % 256;havoc #t~mem134; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,361 INFO L272 TraceCheckUtils]: 25: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {24847#(not (= ~MPR3~0 ~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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:28:41,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-08 08:28:41,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#false} assume !(1 == ~setEventCalled~0); {24836#false} is VALID [2022-04-08 08:28:41,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#false} assume !(1 == ~customIrp~0); {24836#false} is VALID [2022-04-08 08:28:41,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {24836#false} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-08 08:28:41,362 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#false} call errorFn(); {24836#false} is VALID [2022-04-08 08:28:41,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#false} assume !false; {24836#false} is VALID [2022-04-08 08:28:41,362 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-08 08:28:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:28:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562971786] [2022-04-08 08:28:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562971786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:28:41,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:28:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:28:41,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:28:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213129496] [2022-04-08 08:28:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213129496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:28:41,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:28:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:28:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063459650] [2022-04-08 08:28:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:28:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-08 08:28:41,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:28:41,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:28:41,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:41,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:28:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:28:41,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:28:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:28:41,393 INFO L87 Difference]: Start difference. First operand 1164 states and 1722 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:29:08,004 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-08 08:29:15,852 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-08 08:29:19,141 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-08 08:29:24,071 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-08 08:29:30,244 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-08 08:29:34,227 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-08 08:29:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:29:35,349 INFO L93 Difference]: Finished difference Result 2216 states and 3337 transitions. [2022-04-08 08:29:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:29:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-08 08:29:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:29:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:29:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-08 08:29:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:29:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-08 08:29:35,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2771 transitions. [2022-04-08 08:29:38,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2771 edges. 2771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:29:38,443 INFO L225 Difference]: With dead ends: 2216 [2022-04-08 08:29:38,443 INFO L226 Difference]: Without dead ends: 1508 [2022-04-08 08:29:38,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:29:38,446 INFO L913 BasicCegarLoop]: 1355 mSDtfsCounter, 3253 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 1174 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3284 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1174 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:29:38,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3284 Valid, 2625 Invalid, 4899 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1174 Valid, 3719 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2022-04-08 08:29:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-08 08:29:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1158. [2022-04-08 08:29:38,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:29:38,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:29:38,540 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:29:38,541 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:29:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:29:38,620 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-08 08:29:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-08 08:29:38,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:29:38,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:29:38,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-08 08:29:38,633 INFO L87 Difference]: Start difference. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-08 08:29:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:29:38,697 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-08 08:29:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-08 08:29:38,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:29:38,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:29:38,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:29:38,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:29:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:29:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1710 transitions. [2022-04-08 08:29:38,768 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1710 transitions. Word has length 33 [2022-04-08 08:29:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:29:38,768 INFO L478 AbstractCegarLoop]: Abstraction has 1158 states and 1710 transitions. [2022-04-08 08:29:38,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:29:38,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1158 states and 1710 transitions. [2022-04-08 08:29:41,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1710 edges. 1710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:29:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1710 transitions. [2022-04-08 08:29:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 08:29:41,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:29:41,225 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] [2022-04-08 08:29:41,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:29:41,225 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:29:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:29:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 1 times [2022-04-08 08:29:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:29:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1947342255] [2022-04-08 08:29:41,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:29:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 2 times [2022-04-08 08:29:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:29:41,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662282705] [2022-04-08 08:29:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:29:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:29:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:29:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:41,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-08 08:29:41,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 08:29:41,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-08 08:29:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:29:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:41,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {34648#(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; {34635#true} is VALID [2022-04-08 08:29:41,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 08:29:41,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-08 08:29:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:29:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:41,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {34649#(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;~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; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {34635#true} call ULTIMATE.init(); {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:29:41,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-08 08:29:41,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 08:29:41,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-08 08:29:41,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {34635#true} call #t~ret1013 := main(); {34635#true} is VALID [2022-04-08 08:29:41,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {34635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {34635#true} is VALID [2022-04-08 08:29:41,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {34635#true} call _BLAST_init(); {34648#(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-08 08:29:41,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {34648#(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; {34635#true} is VALID [2022-04-08 08:29:41,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 08:29:41,464 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-08 08:29:41,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {34635#true} assume ~status~15 >= 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; {34635#true} is VALID [2022-04-08 08:29:41,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {34635#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {34635#true} is VALID [2022-04-08 08:29:41,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {34635#true} call stub_driver_init(); {34649#(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-08 08:29:41,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {34649#(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;~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; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,466 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {34646#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {34646#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,468 INFO L272 TraceCheckUtils]: 20: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {34646#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,470 INFO L272 TraceCheckUtils]: 24: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {34646#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {34636#false} assume 0 == ~routine~0; {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L272 TraceCheckUtils]: 28: Hoare triple {34636#false} call #t~ret1004 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {34636#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; {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {34636#false} assume 0 != ~myIrp_PendingReturned~0; {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {34636#false} assume !(0 == ~pended~0); {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L272 TraceCheckUtils]: 32: Hoare triple {34636#false} call errorFn(); {34636#false} is VALID [2022-04-08 08:29:41,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {34636#false} assume !false; {34636#false} is VALID [2022-04-08 08:29:41,472 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-08 08:29:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:29:41,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662282705] [2022-04-08 08:29:41,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662282705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:29:41,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:29:41,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:29:41,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:29:41,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1947342255] [2022-04-08 08:29:41,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1947342255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:29:41,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:29:41,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:29:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797178178] [2022-04-08 08:29:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:29:41,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 08:29:41,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:29:41,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:29:41,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:29:41,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:29:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:29:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:29:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:29:41,506 INFO L87 Difference]: Start difference. First operand 1158 states and 1710 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:00,288 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-08 08:30:02,385 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-08 08:30:09,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:11,090 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-08 08:30:16,765 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-08 08:30:23,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:25,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:27,185 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-08 08:30:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:27,851 INFO L93 Difference]: Finished difference Result 2061 states and 3001 transitions. [2022-04-08 08:30:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:30:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 08:30:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:30:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-08 08:30:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-08 08:30:27,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1787 transitions. [2022-04-08 08:30:29,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:30,010 INFO L225 Difference]: With dead ends: 2061 [2022-04-08 08:30:30,010 INFO L226 Difference]: Without dead ends: 1892 [2022-04-08 08:30:30,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:30:30,012 INFO L913 BasicCegarLoop]: 1123 mSDtfsCounter, 1421 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 333 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:30:30,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1465 Valid, 1820 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1519 Invalid, 5 Unknown, 0 Unchecked, 21.0s Time] [2022-04-08 08:30:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-04-08 08:30:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2022-04-08 08:30:30,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:30:30,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:30,154 INFO L74 IsIncluded]: Start isIncluded. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:30,155 INFO L87 Difference]: Start difference. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:30,255 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-08 08:30:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-08 08:30:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:30,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:30,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-08 08:30:30,264 INFO L87 Difference]: Start difference. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-08 08:30:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:30,365 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-08 08:30:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-08 08:30:30,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:30,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:30,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:30:30,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:30:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2381 transitions. [2022-04-08 08:30:30,498 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2381 transitions. Word has length 34 [2022-04-08 08:30:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:30:30,498 INFO L478 AbstractCegarLoop]: Abstraction has 1623 states and 2381 transitions. [2022-04-08 08:30:30,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:30,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1623 states and 2381 transitions. [2022-04-08 08:30:33,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2381 edges. 2381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2381 transitions. [2022-04-08 08:30:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 08:30:33,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:30:33,771 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] [2022-04-08 08:30:33,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:30:33,771 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:30:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:30:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 1 times [2022-04-08 08:30:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [759886694] [2022-04-08 08:30:33,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:30:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 2 times [2022-04-08 08:30:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:30:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712331917] [2022-04-08 08:30:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:30:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:30:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:30:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:33,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-08 08:30:33,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:33,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-08 08:30:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:30:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:33,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {45823#(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; {45810#true} is VALID [2022-04-08 08:30:33,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:33,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-08 08:30:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:30:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:34,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {45824#(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;~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; {45810#true} is VALID [2022-04-08 08:30:34,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:34,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-08 08:30:34,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {45810#true} call ULTIMATE.init(); {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:30:34,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-08 08:30:34,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:34,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-08 08:30:34,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {45810#true} call #t~ret1013 := main(); {45810#true} is VALID [2022-04-08 08:30:34,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {45810#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {45810#true} is VALID [2022-04-08 08:30:34,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {45810#true} call _BLAST_init(); {45823#(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-08 08:30:34,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {45823#(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; {45810#true} is VALID [2022-04-08 08:30:34,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:34,020 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-08 08:30:34,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {45810#true} assume ~status~15 >= 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; {45810#true} is VALID [2022-04-08 08:30:34,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {45810#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {45810#true} is VALID [2022-04-08 08:30:34,021 INFO L272 TraceCheckUtils]: 12: Hoare triple {45810#true} call stub_driver_init(); {45824#(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-08 08:30:34,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {45824#(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;~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; {45810#true} is VALID [2022-04-08 08:30:34,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 08:30:34,021 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {45810#true} assume !!(~status~15 >= 0); {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {45810#true} assume !(2 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {45810#true} assume !(3 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {45810#true} assume 4 == ~__BLAST_NONDET___0~0; {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L272 TraceCheckUtils]: 20: Hoare triple {45810#true} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {45810#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {45810#true} is VALID [2022-04-08 08:30:34,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {45810#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,023 INFO L272 TraceCheckUtils]: 24: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {45821#(= ~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:30:34,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {45811#false} is VALID [2022-04-08 08:30:34,026 INFO L272 TraceCheckUtils]: 32: Hoare triple {45811#false} call errorFn(); {45811#false} is VALID [2022-04-08 08:30:34,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {45811#false} assume !false; {45811#false} is VALID [2022-04-08 08:30:34,026 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-08 08:30:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:30:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712331917] [2022-04-08 08:30:34,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712331917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:34,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:30:34,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:30:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [759886694] [2022-04-08 08:30:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [759886694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:34,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:30:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285651804] [2022-04-08 08:30:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:30:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 08:30:34,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:30:34,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:34,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:34,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:30:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:30:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:30:34,055 INFO L87 Difference]: Start difference. First operand 1623 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:42,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:48,562 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-08 08:30:53,679 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-08 08:31:04,862 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-08 08:31:06,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:09,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:11,570 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-08 08:31:13,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:15,295 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-08 08:31:21,973 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-08 08:31:24,492 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-08 08:31:26,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:31,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:35,407 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-08 08:31:37,953 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-08 08:31:42,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:44,328 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-08 08:31:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:46,654 INFO L93 Difference]: Finished difference Result 1760 states and 2607 transitions. [2022-04-08 08:31:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:31:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 08:31:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:31:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-08 08:31:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:31:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-08 08:31:46,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1223 transitions. [2022-04-08 08:31:48,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1223 edges. 1223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:48,320 INFO L225 Difference]: With dead ends: 1760 [2022-04-08 08:31:48,320 INFO L226 Difference]: Without dead ends: 1756 [2022-04-08 08:31:48,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:31:48,321 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 903 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 360 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:48,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 1471 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1628 Invalid, 12 Unknown, 0 Unchecked, 39.9s Time] [2022-04-08 08:31:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-04-08 08:31:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1622. [2022-04-08 08:31:48,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:48,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:31:48,452 INFO L74 IsIncluded]: Start isIncluded. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:31:48,455 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:31:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:48,545 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-08 08:31:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-08 08:31:48,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:48,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:48,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-08 08:31:48,553 INFO L87 Difference]: Start difference. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-08 08:31:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:48,645 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-08 08:31:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-08 08:31:48,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:48,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:48,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:48,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:31:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2378 transitions. [2022-04-08 08:31:48,806 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2378 transitions. Word has length 34 [2022-04-08 08:31:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:48,807 INFO L478 AbstractCegarLoop]: Abstraction has 1622 states and 2378 transitions. [2022-04-08 08:31:48,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:31:48,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1622 states and 2378 transitions. [2022-04-08 08:31:52,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2378 transitions. [2022-04-08 08:31:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 08:31:52,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:52,131 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] [2022-04-08 08:31:52,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:31:52,131 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 1 times [2022-04-08 08:31:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:52,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54151288] [2022-04-08 08:31:52,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:31:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 2 times [2022-04-08 08:31:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:52,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719538923] [2022-04-08 08:31:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:52,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-08 08:31:52,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-08 08:31:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:31:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:52,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {56127#(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; {56108#true} is VALID [2022-04-08 08:31:52,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-08 08:31:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:31:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:52,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {56128#(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;~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; {56108#true} is VALID [2022-04-08 08:31:52,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-08 08:31:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:31:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:52,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-08 08:31:52,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-08 08:31:52,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-08 08:31:52,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-08 08:31:52,382 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-08 08:31:52,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {56108#true} call ULTIMATE.init(); {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:31:52,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-08 08:31:52,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-08 08:31:52,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {56108#true} call #t~ret1013 := main(); {56108#true} is VALID [2022-04-08 08:31:52,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {56108#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56108#true} is VALID [2022-04-08 08:31:52,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {56108#true} call _BLAST_init(); {56127#(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-08 08:31:52,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {56127#(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; {56108#true} is VALID [2022-04-08 08:31:52,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,397 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-08 08:31:52,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {56108#true} assume ~status~15 >= 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; {56108#true} is VALID [2022-04-08 08:31:52,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {56108#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {56108#true} is VALID [2022-04-08 08:31:52,400 INFO L272 TraceCheckUtils]: 12: Hoare triple {56108#true} call stub_driver_init(); {56128#(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-08 08:31:52,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {56128#(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;~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; {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {56108#true} assume !!(~status~15 >= 0); {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {56108#true} assume !(2 == ~__BLAST_NONDET___0~0); {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {56108#true} assume 3 == ~__BLAST_NONDET___0~0; {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L272 TraceCheckUtils]: 19: Hoare triple {56108#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56108#true} is VALID [2022-04-08 08:31:52,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56108#true} is VALID [2022-04-08 08:31:52,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#true} assume 0 == #t~mem133 % 256;havoc #t~mem133; {56108#true} is VALID [2022-04-08 08:31:52,402 INFO L272 TraceCheckUtils]: 22: Hoare triple {56108#true} call #t~ret135 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-08 08:31:52,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(41);havoc ~cdb~0.base, ~cdb~0.offset;havoc ~inquiryDataPtr~0.base, ~inquiryDataPtr~0.offset;havoc ~attempt~0;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~tmp___11~0;havoc ~tmp___12~0;havoc ~tmp___13~0;havoc ~tmp___14~0;havoc ~tmp___15~0;call ~#deviceParameterHandle~1.base, ~#deviceParameterHandle~1.offset := #Ultimate.allocOnStack(4);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(4);call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem67.base, #t~mem67.offset;havoc #t~mem67.base, #t~mem67.offset; {56108#true} is VALID [2022-04-08 08:31:52,402 INFO L272 TraceCheckUtils]: 24: Hoare triple {56108#true} call #t~ret68 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-08 08:31:52,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(16);havoc ~status~14;havoc ~irpSp~2.base, ~irpSp~2.offset;havoc ~nextIrpSp~1.base, ~nextIrpSp~1.offset;havoc ~irpSp___0~1.base, ~irpSp___0~1.offset;call #t~mem948.base, #t~mem948.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem948.base, #t~mem948.offset;havoc #t~mem948.base, #t~mem948.offset;call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~2.base, ~irpSp~2.offset := #t~mem949.base, #t~mem949.offset;havoc #t~mem949.base, #t~mem949.offset;call #t~mem950.base, #t~mem950.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem950.base, #t~mem950.offset - 36;havoc #t~mem950.base, #t~mem950.offset; {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L272 TraceCheckUtils]: 26: Hoare triple {56108#true} call #t~memmove~res951.base, #t~memmove~res951.offset := #Ultimate.C_memmove(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 28); {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {56108#true} havoc #t~memmove~res951.base, #t~memmove~res951.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56108#true} is VALID [2022-04-08 08:31:52,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {56108#true} assume !(~s~0 != ~NP~0); {56108#true} is VALID [2022-04-08 08:31:52,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {56108#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:31:52,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem952.base, #t~mem952.offset - 36;havoc #t~mem952.base, #t~mem952.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 28 + ~irpSp___0~1.offset, 4);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 32 + ~irpSp___0~1.offset, 4);call write~int(0, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(64, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call #t~mem953 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem953 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem953;call #t~mem954 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem954 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem954;call #t~mem955.base, #t~mem955.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 4); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:31:52,405 INFO L272 TraceCheckUtils]: 36: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~ret956 := IofCallDriver(#t~mem955.base, #t~mem955.offset, ~Irp.base, ~Irp.offset); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:31:52,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:31:52,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56125#(not (= ~routine~0 0))} is VALID [2022-04-08 08:31:52,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {56125#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56109#false} is VALID [2022-04-08 08:31:52,410 INFO L272 TraceCheckUtils]: 40: Hoare triple {56109#false} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56109#false} is VALID [2022-04-08 08:31:52,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {56109#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; {56109#false} is VALID [2022-04-08 08:31:52,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {56109#false} assume 0 != ~myIrp_PendingReturned~0; {56109#false} is VALID [2022-04-08 08:31:52,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {56109#false} assume !(0 == ~pended~0); {56109#false} is VALID [2022-04-08 08:31:52,411 INFO L272 TraceCheckUtils]: 44: Hoare triple {56109#false} call errorFn(); {56109#false} is VALID [2022-04-08 08:31:52,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {56109#false} assume !false; {56109#false} is VALID [2022-04-08 08:31:52,411 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-08 08:31:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719538923] [2022-04-08 08:31:52,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719538923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:52,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:52,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:31:52,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54151288] [2022-04-08 08:31:52,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54151288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:52,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:52,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:31:52,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648447356] [2022-04-08 08:31:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-08 08:31:52,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:52,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:31:52,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:52,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:31:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:31:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:31:52,455 INFO L87 Difference]: Start difference. First operand 1622 states and 2378 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:32:08,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:16,970 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-08 08:32:20,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:22,539 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-08 08:32:30,396 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-08 08:32:36,555 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-08 08:32:41,896 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-08 08:32:48,071 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-08 08:32:56,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:58,086 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-08 08:33:06,564 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-08 08:33:08,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:10,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:17,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-08 08:33:23,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:25,343 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-08 08:33:30,082 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-08 08:33:32,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:38,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:40,860 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-08 08:33:42,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:47,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:48,016 INFO L93 Difference]: Finished difference Result 2729 states and 4036 transitions. [2022-04-08 08:33:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 08:33:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-08 08:33:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:33:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-08 08:33:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:33:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-08 08:33:48,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 2095 transitions. [2022-04-08 08:33:50,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2095 edges. 2095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:50,612 INFO L225 Difference]: With dead ends: 2729 [2022-04-08 08:33:50,612 INFO L226 Difference]: Without dead ends: 1590 [2022-04-08 08:33:50,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-04-08 08:33:50,614 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 2049 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 1041 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:33:50,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2075 Valid, 1616 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2546 Invalid, 14 Unknown, 0 Unchecked, 55.3s Time] [2022-04-08 08:33:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-04-08 08:33:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1195. [2022-04-08 08:33:50,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:50,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:50,744 INFO L74 IsIncluded]: Start isIncluded. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:50,745 INFO L87 Difference]: Start difference. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:50,821 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-08 08:33:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-08 08:33:50,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:50,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:50,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-08 08:33:50,828 INFO L87 Difference]: Start difference. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-08 08:33:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:50,905 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-08 08:33:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-08 08:33:50,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:50,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:50,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:50,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1731 transitions. [2022-04-08 08:33:50,977 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1731 transitions. Word has length 46 [2022-04-08 08:33:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:50,977 INFO L478 AbstractCegarLoop]: Abstraction has 1195 states and 1731 transitions. [2022-04-08 08:33:50,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:33:50,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1195 states and 1731 transitions. [2022-04-08 08:33:53,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1731 transitions. [2022-04-08 08:33:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 08:33:53,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:53,855 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] [2022-04-08 08:33:53,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:33:53,856 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 1 times [2022-04-08 08:33:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:53,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004091517] [2022-04-08 08:33:53,856 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:33:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 2 times [2022-04-08 08:33:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:53,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77287339] [2022-04-08 08:33:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:54,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:33:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:54,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {67200#(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; {67182#true} is VALID [2022-04-08 08:33:54,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 08:33:54,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:33:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:54,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {67201#(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;~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; {67182#true} is VALID [2022-04-08 08:33:54,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 08:33:54,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-08 08:33:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:54,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-08 08:33:54,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-08 08:33:54,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-08 08:33:54,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-08 08:33:54,141 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {67182#true} call ULTIMATE.init(); {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:33:54,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret1013 := main(); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67200#(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-08 08:33:54,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {67200#(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; {67182#true} is VALID [2022-04-08 08:33:54,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 08:33:54,146 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 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; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67201#(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-08 08:33:54,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {67201#(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;~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; {67182#true} is VALID [2022-04-08 08:33:54,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 08:33:54,148 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,149 INFO L272 TraceCheckUtils]: 18: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret972 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem162.base, #t~mem162.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem162.base, #t~mem162.offset;havoc #t~mem162.base, #t~mem162.offset;call #t~mem163 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem163 % 256);havoc #t~mem163;call #t~mem164 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem164 % 256);havoc #t~mem164;call #t~mem165 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem165 % 256);havoc #t~mem165;call #t~mem166 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem166 % 256;havoc #t~mem166; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,151 INFO L272 TraceCheckUtils]: 24: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret170 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem935.base, #t~mem935.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem935.base, #t~mem935.offset;havoc #t~mem935.base, #t~mem935.offset;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem936.base, #t~mem936.offset - 36;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem937.base, #t~mem937.offset;havoc #t~mem937.base, #t~mem937.offset;call #t~mem938 := read~int(~currentIrpStack~7.base, 12 + ~currentIrpStack~7.offset, 4); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume #t~mem938 % 4294967296 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 4294967296;havoc #t~mem938;call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~1.base, ~irpSp~1.offset := #t~mem939.base, #t~mem939.offset;havoc #t~mem939.base, #t~mem939.offset;call #t~mem940.base, #t~mem940.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem940.base, #t~mem940.offset - 36;havoc #t~mem940.base, #t~mem940.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,153 INFO L272 TraceCheckUtils]: 27: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~memmove~res941.base, #t~memmove~res941.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 28); {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 08:33:54,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-08 08:33:54,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-08 08:33:54,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-08 08:33:54,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-08 08:33:54,155 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc #t~memmove~res941.base, #t~memmove~res941.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem942.base, #t~mem942.offset - 36;havoc #t~mem942.base, #t~mem942.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.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~mem943 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem943 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem943;call #t~mem944 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem944 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem944;call #t~mem945.base, #t~mem945.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 4); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,156 INFO L272 TraceCheckUtils]: 37: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret946 := IofCallDriver(#t~mem945.base, #t~mem945.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,158 INFO L272 TraceCheckUtils]: 41: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {67187#(= ~myIrp_PendingReturned~0 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; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:33:54,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67183#false} is VALID [2022-04-08 08:33:54,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {67183#false} assume !(0 == ~pended~0); {67183#false} is VALID [2022-04-08 08:33:54,159 INFO L272 TraceCheckUtils]: 45: Hoare triple {67183#false} call errorFn(); {67183#false} is VALID [2022-04-08 08:33:54,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {67183#false} assume !false; {67183#false} is VALID [2022-04-08 08:33:54,159 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-08 08:33:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77287339] [2022-04-08 08:33:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77287339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:54,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:54,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:33:54,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004091517] [2022-04-08 08:33:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004091517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:54,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:54,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:33:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763425791] [2022-04-08 08:33:54,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-08 08:33:54,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:54,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:33:54,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:54,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:33:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:33:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:33:54,206 INFO L87 Difference]: Start difference. First operand 1195 states and 1731 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:34:14,550 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-08 08:34:20,612 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-08 08:34:24,678 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-08 08:34:29,405 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-08 08:34:31,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:33,651 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-08 08:34:36,948 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-08 08:34:40,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:42,775 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-08 08:34:44,780 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-08 08:34:52,733 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-08 08:34:57,945 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-08 08:35:02,695 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-08 08:35:06,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:11,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:14,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:16,756 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-08 08:35:20,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:23,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:25,037 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-08 08:35:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:26,029 INFO L93 Difference]: Finished difference Result 2147 states and 3201 transitions. [2022-04-08 08:35:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:35:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-08 08:35:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:35:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:35:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-08 08:35:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:35:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-08 08:35:26,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1894 transitions. [2022-04-08 08:35:28,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1894 edges. 1894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:28,403 INFO L225 Difference]: With dead ends: 2147 [2022-04-08 08:35:28,403 INFO L226 Difference]: Without dead ends: 1478 [2022-04-08 08:35:28,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:35:28,405 INFO L913 BasicCegarLoop]: 738 mSDtfsCounter, 1787 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 753 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:35:28,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 1168 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2304 Invalid, 14 Unknown, 0 Unchecked, 48.8s Time] [2022-04-08 08:35:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-04-08 08:35:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1192. [2022-04-08 08:35:28,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:35:28,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:35:28,567 INFO L74 IsIncluded]: Start isIncluded. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:35:28,569 INFO L87 Difference]: Start difference. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:35:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:28,631 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-08 08:35:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-08 08:35:28,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:28,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:28,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-08 08:35:28,637 INFO L87 Difference]: Start difference. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-08 08:35:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:28,699 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-08 08:35:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-08 08:35:28,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:28,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:28,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:35:28,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:35:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:35:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1720 transitions. [2022-04-08 08:35:28,768 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1720 transitions. Word has length 47 [2022-04-08 08:35:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:35:28,768 INFO L478 AbstractCegarLoop]: Abstraction has 1192 states and 1720 transitions. [2022-04-08 08:35:28,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:35:28,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1192 states and 1720 transitions. [2022-04-08 08:35:31,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1720 edges. 1720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1720 transitions. [2022-04-08 08:35:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 08:35:31,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:35:31,681 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] [2022-04-08 08:35:31,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:35:31,682 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:35:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:35:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 1 times [2022-04-08 08:35:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423250520] [2022-04-08 08:35:31,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:35:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 2 times [2022-04-08 08:35:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323729238] [2022-04-08 08:35:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-08 08:35:31,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 08:35:31,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-08 08:35:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:35:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {76880#(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; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:35:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {76881#(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;~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; {76852#true} is VALID [2022-04-08 08:35:31,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 08:35:31,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 08:35:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 08:35:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:31,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,950 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-08 08:35:31,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:35:31,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:35:31,952 INFO L272 TraceCheckUtils]: 3: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:31,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,958 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,959 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-08 08:35:31,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {76852#true} call ULTIMATE.init(); {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:35:31,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-08 08:35:31,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 08:35:31,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-08 08:35:31,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {76852#true} call #t~ret1013 := main(); {76852#true} is VALID [2022-04-08 08:35:31,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {76852#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {76852#true} is VALID [2022-04-08 08:35:31,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {76852#true} call _BLAST_init(); {76880#(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-08 08:35:31,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {76880#(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; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,962 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 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; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {76860#(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; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,963 INFO L272 TraceCheckUtils]: 12: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {76881#(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-08 08:35:31,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {76881#(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;~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; {76852#true} is VALID [2022-04-08 08:35:31,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 08:35:31,964 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:35:31,965 INFO L272 TraceCheckUtils]: 20: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:31,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-08 08:35:31,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:35:31,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:35:31,967 INFO L272 TraceCheckUtils]: 24: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:31,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:35:31,970 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:35:31,971 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {76853#false} assume -2147483648 <= #t~ret974 && #t~ret974 <= 2147483647;~status~15 := #t~ret974;havoc #t~ret974; {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {76853#false} assume 0 != ~we_should_unload~0; {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {76853#false} assume !(~s~0 == ~UNLOADED~0); {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {76853#false} assume !(-1 == ~status~15); {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {76853#false} assume !(~s~0 != ~SKIP2~0); {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {76853#false} assume 1 == ~pended~0; {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {76853#false} assume 259 != ~status~15; {76853#false} is VALID [2022-04-08 08:35:31,971 INFO L272 TraceCheckUtils]: 45: Hoare triple {76853#false} call errorFn(); {76853#false} is VALID [2022-04-08 08:35:31,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {76853#false} assume !false; {76853#false} is VALID [2022-04-08 08:35:31,973 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-08 08:35:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:31,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323729238] [2022-04-08 08:35:31,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323729238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:31,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:31,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:35:31,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:31,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423250520] [2022-04-08 08:35:31,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423250520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:31,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:31,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:35:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632127656] [2022-04-08 08:35:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-08 08:35:31,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:31,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:32,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:32,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:35:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:35:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:35:32,019 INFO L87 Difference]: Start difference. First operand 1192 states and 1720 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:57,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:08,917 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-08 08:36:10,964 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-08 08:36:13,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:15,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:24,600 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-08 08:36:26,642 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-08 08:36:28,666 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-08 08:36:36,403 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-08 08:36:40,702 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-08 08:36:47,901 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-08 08:36:54,765 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-08 08:37:04,595 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-08 08:37:08,725 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-08 08:37:19,372 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-08 08:37:21,418 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-08 08:37:26,155 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-08 08:37:30,583 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-08 08:37:39,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:41,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:45,170 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:47,320 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-08 08:37:49,360 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-08 08:37:54,104 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-08 08:37:56,987 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-08 08:38:02,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:06,922 INFO L93 Difference]: Finished difference Result 1825 states and 2709 transitions. [2022-04-08 08:38:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 08:38:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-08 08:38:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:38:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-08 08:38:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:38:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-08 08:38:06,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 1912 transitions. [2022-04-08 08:38:09,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1912 edges. 1912 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:09,617 INFO L225 Difference]: With dead ends: 1825 [2022-04-08 08:38:09,617 INFO L226 Difference]: Without dead ends: 1764 [2022-04-08 08:38:09,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2022-04-08 08:38:09,618 INFO L913 BasicCegarLoop]: 1012 mSDtfsCounter, 2909 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 1419 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 5750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1419 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:09,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2941 Valid, 2754 Invalid, 5750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1419 Valid, 4311 Invalid, 20 Unknown, 0 Unchecked, 70.8s Time] [2022-04-08 08:38:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-08 08:38:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1264. [2022-04-08 08:38:09,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:09,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:38:09,823 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:38:09,824 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:38:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:09,919 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-08 08:38:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-08 08:38:09,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:09,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:09,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-08 08:38:09,926 INFO L87 Difference]: Start difference. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-08 08:38:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:10,019 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-08 08:38:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-08 08:38:10,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:10,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:10,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:10,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:38:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1808 transitions. [2022-04-08 08:38:10,099 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1808 transitions. Word has length 47 [2022-04-08 08:38:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:10,100 INFO L478 AbstractCegarLoop]: Abstraction has 1264 states and 1808 transitions. [2022-04-08 08:38:10,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:38:10,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1264 states and 1808 transitions. [2022-04-08 08:38:13,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1808 edges. 1808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1808 transitions. [2022-04-08 08:38:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:38:13,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:13,445 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] [2022-04-08 08:38:13,445 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:38:13,446 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 1 times [2022-04-08 08:38:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771201584] [2022-04-08 08:38:13,446 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:38:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 2 times [2022-04-08 08:38:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:13,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455276024] [2022-04-08 08:38:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-08 08:38:13,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 08:38:13,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-08 08:38:13,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:38:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {86665#(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; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:38:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {86666#(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;~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; {86635#true} is VALID [2022-04-08 08:38:13,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 08:38:13,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 08:38:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 08:38:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:13,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 08:38:13,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 08:38:13,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 08:38:13,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 08:38:13,739 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 08:38:13,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-08 08:38:13,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-08 08:38:13,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {86635#true} is VALID [2022-04-08 08:38:13,741 INFO L272 TraceCheckUtils]: 3: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:38:13,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 08:38:13,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 08:38:13,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 08:38:13,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 08:38:13,743 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 08:38:13,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {86636#false} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-08 08:38:13,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 08:38:13,743 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-08 08:38:13,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {86635#true} call ULTIMATE.init(); {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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-08 08:38:13,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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)|) (= |old(~routine~0)| ~routine~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);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-08 08:38:13,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 08:38:13,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-08 08:38:13,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {86635#true} call #t~ret1013 := main(); {86635#true} is VALID [2022-04-08 08:38:13,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {86635#true} is VALID [2022-04-08 08:38:13,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {86635#true} call _BLAST_init(); {86665#(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-08 08:38:13,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {86665#(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; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,747 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume ~status~15 >= 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; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,748 INFO L272 TraceCheckUtils]: 12: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call stub_driver_init(); {86666#(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-08 08:38:13,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {86666#(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;~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; {86635#true} is VALID [2022-04-08 08:38:13,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 08:38:13,748 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !!(~status~15 >= 0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(2 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(3 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 4 == ~__BLAST_NONDET___0~0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 08:38:13,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:38:13,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-08 08:38:13,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-08 08:38:13,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {86635#true} is VALID [2022-04-08 08:38:13,752 INFO L272 TraceCheckUtils]: 24: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:38:13,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~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~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 08:38:13,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 08:38:13,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 08:38:13,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {86636#false} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 08:38:13,753 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {86636#false} assume -2147483648 <= #t~ret974 && #t~ret974 <= 2147483647;~status~15 := #t~ret974;havoc #t~ret974; {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {86636#false} assume 0 != ~we_should_unload~0; {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {86636#false} assume !(~s~0 == ~UNLOADED~0); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {86636#false} assume !(-1 == ~status~15); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {86636#false} assume !(~s~0 != ~SKIP2~0); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {86636#false} assume 1 == ~pended~0; {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {86636#false} assume 259 != ~status~15; {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L272 TraceCheckUtils]: 47: Hoare triple {86636#false} call errorFn(); {86636#false} is VALID [2022-04-08 08:38:13,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {86636#false} assume !false; {86636#false} is VALID [2022-04-08 08:38:13,754 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-08 08:38:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455276024] [2022-04-08 08:38:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455276024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:38:13,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771201584] [2022-04-08 08:38:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771201584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:38:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940561224] [2022-04-08 08:38:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-04-08 08:38:13,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:13,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:38:13,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:13,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:38:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:13,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:38:13,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:38:13,794 INFO L87 Difference]: Start difference. First operand 1264 states and 1808 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)