/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-fb4f59a-m [2022-04-28 08:22:49,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:22:49,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:22:49,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:22:49,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:22:49,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:22:49,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:22:49,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:22:49,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:22:49,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:22:49,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:22:49,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:22:49,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:22:49,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:22:49,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:22:49,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:22:49,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:22:49,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:22:49,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:22:49,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:22:49,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:22:49,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:22:49,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:22:49,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:22:49,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:22:49,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:22:49,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:22:49,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:22:49,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:22:49,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:22:49,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:22:49,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:22:49,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:22:49,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:22:49,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:22:49,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:22:49,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:22:49,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:22:49,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:22:49,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:22:49,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:22:49,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:22:49,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:22:49,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:22:49,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:22:49,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:22:49,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:22:49,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:22:49,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:22:49,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:22:49,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:22:49,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:22:49,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:22:49,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:22:49,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:49,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:22:49,771 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:22:49,772 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:22:49,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:22:49,772 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:22:49,772 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-28 08:22:49,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:22:50,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:22:50,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:22:50,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:22:50,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:22:50,013 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-28 08:22:50,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5762be/1de92d6fa5fb4f82a3a518cd0e40b891/FLAGb5f3b63e8 [2022-04-28 08:22:50,701 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:22:50,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-28 08:22:50,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5762be/1de92d6fa5fb4f82a3a518cd0e40b891/FLAGb5f3b63e8 [2022-04-28 08:22:50,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5762be/1de92d6fa5fb4f82a3a518cd0e40b891 [2022-04-28 08:22:50,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:22:50,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:22:50,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:50,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:22:50,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:22:50,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:50" (1/1) ... [2022-04-28 08:22:50,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd29cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:50, skipping insertion in model container [2022-04-28 08:22:50,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:50" (1/1) ... [2022-04-28 08:22:50,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:22:50,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:22:51,450 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-28 08:22:51,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:51,948 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:22:51,995 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-28 08:22:52,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:52,232 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:22:52,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52 WrapperNode [2022-04-28 08:22:52,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:52,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:22:52,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:22:52,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:22:52,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:22:52,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:22:52,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:22:52,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:22:52,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (1/1) ... [2022-04-28 08:22:52,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:22:52,523 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-28 08:22:52,542 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-28 08:22:52,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:22:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:22:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:22:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-28 08:22:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-28 08:22:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-28 08:22:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-28 08:22:52,555 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-28 08:22:52,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 08:22:52,557 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-28 08:22:52,558 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-28 08:22:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-28 08:22:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-28 08:22:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-28 08:22:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-28 08:22:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-28 08:22:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-28 08:22:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:22:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-28 08:22:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-28 08:22:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-28 08:22:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-28 08:22:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-28 08:22:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-28 08:22:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-28 08:22:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-28 08:22:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-28 08:22:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-28 08:22:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-28 08:22:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-28 08:22:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-28 08:22:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:22:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:22:53,031 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:22:53,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:22:53,055 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:53,090 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:53,090 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:53,091 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:53,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:53,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:53,104 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:53,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:53,110 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:53,110 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:53,136 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:53,136 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:53,142 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:55,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 08:22:55,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 08:22:55,681 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:55,689 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:55,689 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:55,689 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:55,699 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:55,699 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:55,700 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:55,745 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:55,745 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:55,745 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:55,771 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:55,771 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:55,791 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,026 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:23:00,026 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:23:00,031 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,142 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-28 08:23:00,143 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-28 08:23:00,148 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:00,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:00,153 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-28 08:23:00,172 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-28 08:23:00,172 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,176 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:00,176 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:00,176 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,182 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:00,182 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:00,198 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,204 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:00,205 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:00,205 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:00,209 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:00,209 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:00,504 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:03,496 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:23:03,496 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:23:03,503 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:07,727 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-28 08:23:07,727 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-28 08:23:07,736 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:07,755 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-28 08:23:07,755 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-28 08:23:07,772 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:07,776 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:07,776 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:07,818 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:07,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-28 08:23:07,879 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-28 08:23:07,984 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:07,988 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:07,988 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:08,064 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:08,069 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:08,069 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:08,069 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,421 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 08:23:13,422 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 08:23:13,426 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-28 08:23:13,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-28 08:23:13,450 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,459 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-28 08:23:13,459 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-28 08:23:13,527 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,532 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:13,532 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:13,878 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-28 08:23:13,920 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-28 08:23:13,920 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-28 08:23:13,920 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:13,925 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:23:13,925 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:23:13,978 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:23:18,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:23:18,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:23:18,572 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:23:18,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:23:18,587 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-04-28 08:23:18,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:23:18 BoogieIcfgContainer [2022-04-28 08:23:18,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:23:18,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:23:18,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:23:18,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:23:18,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:22:50" (1/3) ... [2022-04-28 08:23:18,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc0caa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:23:18, skipping insertion in model container [2022-04-28 08:23:18,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:52" (2/3) ... [2022-04-28 08:23:18,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc0caa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:23:18, skipping insertion in model container [2022-04-28 08:23:18,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:23:18" (3/3) ... [2022-04-28 08:23:18,598 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-04-28 08:23:18,607 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:23:18,607 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:23:18,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:23:18,675 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@131b3da2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@babd2c5 [2022-04-28 08:23:18,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:23:18,694 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-28 08:23:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:23:18,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:18,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:23:18,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 1 times [2022-04-28 08:23:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:18,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351726272] [2022-04-28 08:23:18,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 2 times [2022-04-28 08:23:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322930014] [2022-04-28 08:23:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:19,108 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-28 08:23:19,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-28 08:23:19,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-28 08:23:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:23:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:19,162 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-28 08:23:19,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,165 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-28 08:23:19,165 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-28 08:23:19,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-28 08:23:19,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-28 08:23:19,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1256#true} call #t~ret1013 := main(); {1256#true} is VALID [2022-04-28 08:23:19,166 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-28 08:23:19,167 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-28 08:23:19,168 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-28 08:23:19,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,169 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:23:19,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1257#false} is VALID [2022-04-28 08:23:19,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#false} assume !(-1 == ~status~15); {1257#false} is VALID [2022-04-28 08:23:19,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#false} assume !(~s~0 != ~SKIP2~0); {1257#false} is VALID [2022-04-28 08:23:19,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#false} assume 1 == ~pended~0; {1257#false} is VALID [2022-04-28 08:23:19,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#false} assume 259 != ~status~15; {1257#false} is VALID [2022-04-28 08:23:19,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {1257#false} call errorFn(); {1257#false} is VALID [2022-04-28 08:23:19,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-04-28 08:23:19,172 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-28 08:23:19,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322930014] [2022-04-28 08:23:19,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322930014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:19,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:19,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:23:19,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:19,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351726272] [2022-04-28 08:23:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351726272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:19,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:23:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818119307] [2022-04-28 08:23:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:19,180 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-28 08:23:19,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:19,184 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-28 08:23:19,212 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-28 08:23:19,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:23:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:23:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:23:19,239 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-28 08:23:31,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:35,795 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-28 08:23:42,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-28 08:23:48,705 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-28 08:23:54,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:56,213 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-28 08:24:01,129 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-28 08:24:07,202 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-28 08:24:09,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:11,752 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-28 08:24:15,784 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-28 08:24:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:16,404 INFO L93 Difference]: Finished difference Result 1365 states and 2147 transitions. [2022-04-28 08:24:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:24:16,404 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-28 08:24:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:24:16,405 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-28 08:24:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-28 08:24:16,456 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-28 08:24:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-28 08:24:16,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2147 transitions. [2022-04-28 08:24:18,575 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-28 08:24:18,683 INFO L225 Difference]: With dead ends: 1365 [2022-04-28 08:24:18,684 INFO L226 Difference]: Without dead ends: 834 [2022-04-28 08:24:18,694 INFO L412 NwaCegarLoop]: 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-28 08:24:18,696 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 460 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 187 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:24:18,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1299 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1973 Invalid, 8 Unknown, 0 Unchecked, 28.2s Time] [2022-04-28 08:24:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-28 08:24:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 671. [2022-04-28 08:24:18,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:24:18,795 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-28 08:24:18,801 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-28 08:24:18,803 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-28 08:24:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:18,885 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-28 08:24:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-28 08:24:18,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:18,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:18,898 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-28 08:24:18,899 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-28 08:24:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:18,961 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-28 08:24:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-28 08:24:18,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:18,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:18,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:24:18,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:24:18,967 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-28 08:24:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 980 transitions. [2022-04-28 08:24:18,996 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 980 transitions. Word has length 20 [2022-04-28 08:24:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:24:18,997 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 980 transitions. [2022-04-28 08:24:18,997 INFO L496 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-28 08:24:18,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 671 states and 980 transitions. [2022-04-28 08:24:20,030 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-28 08:24:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 980 transitions. [2022-04-28 08:24:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:24:20,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:20,031 INFO L195 NwaCegarLoop]: 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-28 08:24:20,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:24:20,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 1 times [2022-04-28 08:24:20,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:20,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799063812] [2022-04-28 08:24:20,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 2 times [2022-04-28 08:24:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:20,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255829965] [2022-04-28 08:24:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:20,199 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-28 08:24:20,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-28 08:24:20,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-28 08:24:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:24:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:20,244 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-28 08:24:20,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-28 08:24:20,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-28 08:24:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:24:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:20,281 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-28 08:24:20,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:24:20,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:24:20,284 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-28 08:24:20,284 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-28 08:24:20,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-28 08:24:20,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-28 08:24:20,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {7014#true} call #t~ret1013 := main(); {7014#true} is VALID [2022-04-28 08:24:20,285 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-28 08:24:20,286 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-28 08:24:20,286 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-28 08:24:20,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-28 08:24:20,288 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-28 08:24:20,288 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-28 08:24:20,288 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-28 08:24:20,289 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-28 08:24:20,293 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-28 08:24:20,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:24:20,294 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:24:20,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:24:20,295 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-28 08:24:20,295 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-28 08:24:20,296 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-28 08:24:20,296 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-28 08:24:20,297 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-28 08:24:20,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7015#false} is VALID [2022-04-28 08:24:20,297 INFO L272 TraceCheckUtils]: 23: Hoare triple {7015#false} call errorFn(); {7015#false} is VALID [2022-04-28 08:24:20,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {7015#false} assume !false; {7015#false} is VALID [2022-04-28 08:24:20,298 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-28 08:24:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255829965] [2022-04-28 08:24:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255829965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:20,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:24:20,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799063812] [2022-04-28 08:24:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799063812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:20,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:20,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:24:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801876840] [2022-04-28 08:24:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:20,301 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-28 08:24:20,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:20,301 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-28 08:24:20,323 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-28 08:24:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:24:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:24:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:24:20,324 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-28 08:24:33,867 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-28 08:24:35,896 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-28 08:24:39,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:47,718 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-28 08:24:49,722 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-28 08:24:58,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:01,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:08,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:13,257 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-28 08:25:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:13,965 INFO L93 Difference]: Finished difference Result 1451 states and 2142 transitions. [2022-04-28 08:25:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:25:13,965 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-28 08:25:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:25:13,965 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-28 08:25:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-28 08:25:13,983 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-28 08:25:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-28 08:25:14,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2142 transitions. [2022-04-28 08:25:16,338 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-28 08:25:16,401 INFO L225 Difference]: With dead ends: 1451 [2022-04-28 08:25:16,401 INFO L226 Difference]: Without dead ends: 1173 [2022-04-28 08:25:16,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-28 08:25:16,402 INFO L413 NwaCegarLoop]: 1198 mSDtfsCounter, 1930 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 573 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:25:16,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 1924 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1789 Invalid, 4 Unknown, 0 Unchecked, 22.8s Time] [2022-04-28 08:25:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-04-28 08:25:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 983. [2022-04-28 08:25:16,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:25:16,483 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-28 08:25:16,485 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-28 08:25:16,488 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-28 08:25:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:16,542 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-28 08:25:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-28 08:25:16,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:16,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:25:16,547 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-28 08:25:16,549 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-28 08:25:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:16,600 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-28 08:25:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-28 08:25:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:25:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:25:16,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:25:16,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:25:16,606 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-28 08:25:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1437 transitions. [2022-04-28 08:25:16,712 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1437 transitions. Word has length 25 [2022-04-28 08:25:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:25:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1437 transitions. [2022-04-28 08:25:16,713 INFO L496 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-28 08:25:16,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 983 states and 1437 transitions. [2022-04-28 08:25:18,504 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-28 08:25:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1437 transitions. [2022-04-28 08:25:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:25:18,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:25:18,506 INFO L195 NwaCegarLoop]: 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-28 08:25:18,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:25:18,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:25:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:25:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 1 times [2022-04-28 08:25:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:25:18,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859994060] [2022-04-28 08:25:18,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:25:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 2 times [2022-04-28 08:25:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:25:18,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374210786] [2022-04-28 08:25:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:25:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:25:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:25:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:18,625 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-28 08:25:18,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-28 08:25:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:25:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:18,658 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-28 08:25:18,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-28 08:25:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:25:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:25:18,680 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-28 08:25:18,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-28 08:25:18,681 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-28 08:25:18,681 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-28 08:25:18,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-28 08:25:18,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {14251#true} call #t~ret1013 := main(); {14251#true} is VALID [2022-04-28 08:25:18,682 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-28 08:25:18,683 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-28 08:25:18,683 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-28 08:25:18,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,683 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-28 08:25:18,683 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-28 08:25:18,683 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-28 08:25:18,684 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-28 08:25:18,684 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-28 08:25:18,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-28 08:25:18,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-28 08:25:18,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {14251#true} assume !!(~status~15 >= 0); {14251#true} is VALID [2022-04-28 08:25:18,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {14251#true} assume !(2 == ~__BLAST_NONDET___0~0); {14251#true} is VALID [2022-04-28 08:25:18,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {14251#true} assume 3 == ~__BLAST_NONDET___0~0; {14251#true} is VALID [2022-04-28 08:25:18,685 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-28 08:25:18,685 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-28 08:25:18,685 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-28 08:25:18,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {14251#true} assume 22 == #t~mem134 % 256;havoc #t~mem134; {14251#true} is VALID [2022-04-28 08:25:18,685 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-28 08:25:18,685 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-28 08:25:18,685 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-28 08:25:18,686 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-28 08:25:18,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {14251#true} assume !(~s~0 == ~MPR3~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:25:18,686 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-28 08:25:18,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14252#false} is VALID [2022-04-28 08:25:18,687 INFO L272 TraceCheckUtils]: 30: Hoare triple {14252#false} call errorFn(); {14252#false} is VALID [2022-04-28 08:25:18,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {14252#false} assume !false; {14252#false} is VALID [2022-04-28 08:25:18,687 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-28 08:25:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:25:18,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374210786] [2022-04-28 08:25:18,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374210786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:25:18,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:25:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:25:18,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:25:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859994060] [2022-04-28 08:25:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859994060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:25:18,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:25:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:25:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904427356] [2022-04-28 08:25:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:25:18,688 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-28 08:25:18,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:25:18,689 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-28 08:25:18,714 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-28 08:25:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:25:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:25:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:25:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:25:18,715 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-28 08:25:36,378 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-28 08:25:43,833 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-28 08:25:53,936 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-28 08:25:58,632 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-28 08:26:01,528 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-28 08:26:02,946 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-28 08:26:05,218 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-28 08:26:13,999 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-28 08:26:19,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:26,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:28,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:31,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:36,936 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-28 08:26:39,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:41,250 INFO L93 Difference]: Finished difference Result 2287 states and 3438 transitions. [2022-04-28 08:26:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:26:41,250 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-28 08:26:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:26:41,250 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-28 08:26:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-28 08:26:41,270 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-28 08:26:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-28 08:26:41,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2358 transitions. [2022-04-28 08:26:43,916 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-28 08:26:44,084 INFO L225 Difference]: With dead ends: 2287 [2022-04-28 08:26:44,085 INFO L226 Difference]: Without dead ends: 1830 [2022-04-28 08:26:44,086 INFO L412 NwaCegarLoop]: 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-28 08:26:44,087 INFO L413 NwaCegarLoop]: 1374 mSDtfsCounter, 1545 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 516 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:26:44,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2171 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2318 Invalid, 9 Unknown, 0 Unchecked, 37.7s Time] [2022-04-28 08:26:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-04-28 08:26:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1164. [2022-04-28 08:26:44,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:26:44,174 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-28 08:26:44,176 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-28 08:26:44,178 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-28 08:26:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:44,287 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-28 08:26:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-28 08:26:44,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:44,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:44,297 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-28 08:26:44,299 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-28 08:26:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:44,421 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-28 08:26:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-28 08:26:44,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:44,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:44,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:26:44,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:26:44,429 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-28 08:26:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1722 transitions. [2022-04-28 08:26:44,495 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1722 transitions. Word has length 32 [2022-04-28 08:26:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:26:44,495 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 1722 transitions. [2022-04-28 08:26:44,496 INFO L496 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-28 08:26:44,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1722 transitions. [2022-04-28 08:26:46,695 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-28 08:26:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1722 transitions. [2022-04-28 08:26:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:26:46,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:26:46,696 INFO L195 NwaCegarLoop]: 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-28 08:26:46,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:26:46,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:26:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:26:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 1 times [2022-04-28 08:26:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:46,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368576914] [2022-04-28 08:26:46,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:26:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 2 times [2022-04-28 08:26:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:26:46,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857388882] [2022-04-28 08:26:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:26:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:26:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:26:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:46,859 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-28 08:26:46,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-28 08:26:46,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-28 08:26:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:26:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:46,894 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-28 08:26:46,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:46,895 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-28 08:26:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:26:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:46,927 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-28 08:26:46,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:26:46,928 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-28 08:26:46,929 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-28 08:26:46,929 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-28 08:26:46,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-28 08:26:46,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-28 08:26:46,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {24835#true} call #t~ret1013 := main(); {24835#true} is VALID [2022-04-28 08:26:46,930 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-28 08:26:46,931 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-28 08:26:46,932 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-28 08:26:46,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:46,939 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-28 08:26:46,941 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-28 08:26:46,942 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-28 08:26:46,942 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-28 08:26:46,943 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-28 08:26:46,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:26:46,943 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-28 08:26:46,944 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-28 08:26:46,944 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-28 08:26:46,944 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-28 08:26:46,945 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-28 08:26:46,945 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-28 08:26:46,946 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-28 08:26:46,946 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-28 08:26:46,946 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-28 08:26:46,947 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-28 08:26:46,947 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-28 08:26:46,948 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-28 08:26:46,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-28 08:26:46,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#false} assume !(1 == ~setEventCalled~0); {24836#false} is VALID [2022-04-28 08:26:46,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#false} assume !(1 == ~customIrp~0); {24836#false} is VALID [2022-04-28 08:26:46,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {24836#false} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-28 08:26:46,948 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#false} call errorFn(); {24836#false} is VALID [2022-04-28 08:26:46,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#false} assume !false; {24836#false} is VALID [2022-04-28 08:26:46,949 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-28 08:26:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:26:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857388882] [2022-04-28 08:26:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857388882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:46,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:46,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:26:46,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:26:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368576914] [2022-04-28 08:26:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368576914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:46,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:46,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:26:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841574929] [2022-04-28 08:26:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:26:46,950 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-28 08:26:46,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:26:46,950 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-28 08:26:46,974 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-28 08:26:46,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 08:26:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 08:26:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:26:46,975 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-28 08:27:12,259 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-28 08:27:17,475 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-28 08:27:19,736 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-28 08:27:21,780 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-28 08:27:26,834 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-28 08:27:31,647 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-28 08:27:33,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:37,993 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-28 08:27:39,997 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-28 08:27:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:41,106 INFO L93 Difference]: Finished difference Result 2216 states and 3337 transitions. [2022-04-28 08:27:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:27:41,107 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-28 08:27:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:27:41,107 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-28 08:27:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-28 08:27:41,135 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-28 08:27:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-28 08:27:41,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2771 transitions. [2022-04-28 08:27:43,945 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-28 08:27:44,049 INFO L225 Difference]: With dead ends: 2216 [2022-04-28 08:27:44,049 INFO L226 Difference]: Without dead ends: 1508 [2022-04-28 08:27:44,051 INFO L412 NwaCegarLoop]: 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-28 08:27:44,051 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 3259 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 1177 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:27:44,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3290 Valid, 2616 Invalid, 4875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 3692 Invalid, 6 Unknown, 0 Unchecked, 26.9s Time] [2022-04-28 08:27:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-28 08:27:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1158. [2022-04-28 08:27:44,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:27:44,141 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-28 08:27:44,142 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-28 08:27:44,143 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-28 08:27:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:44,214 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-28 08:27:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-28 08:27:44,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:27:44,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:27:44,220 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-28 08:27:44,221 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-28 08:27:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:44,291 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-28 08:27:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-28 08:27:44,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:27:44,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:27:44,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:27:44,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:27:44,297 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-28 08:27:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1710 transitions. [2022-04-28 08:27:44,380 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1710 transitions. Word has length 33 [2022-04-28 08:27:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:27:44,380 INFO L495 AbstractCegarLoop]: Abstraction has 1158 states and 1710 transitions. [2022-04-28 08:27:44,380 INFO L496 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-28 08:27:44,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1158 states and 1710 transitions. [2022-04-28 08:27:46,693 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-28 08:27:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1710 transitions. [2022-04-28 08:27:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:27:46,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:27:46,694 INFO L195 NwaCegarLoop]: 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-28 08:27:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:27:46,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:27:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:27:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 1 times [2022-04-28 08:27:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:27:46,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900585343] [2022-04-28 08:27:46,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:27:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 2 times [2022-04-28 08:27:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:27:46,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399617122] [2022-04-28 08:27:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:27:46,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:27:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:27:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:27:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:27:46,862 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-28 08:27:46,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-28 08:27:46,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-28 08:27:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:27:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:27:46,894 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-28 08:27:46,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-28 08:27:46,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-28 08:27:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:27:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:27:46,954 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-28 08:27:46,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,956 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-28 08:27:46,956 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-28 08:27:46,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-28 08:27:46,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-28 08:27:46,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {34635#true} call #t~ret1013 := main(); {34635#true} is VALID [2022-04-28 08:27:46,957 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-28 08:27:46,958 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-28 08:27:46,958 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-28 08:27:46,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-28 08:27:46,958 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-28 08:27:46,958 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-28 08:27:46,958 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-28 08:27:46,959 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-28 08:27:46,959 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-28 08:27:46,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,960 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {34646#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {34646#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:27:46,962 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-28 08:27:46,963 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-28 08:27:46,963 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-28 08:27:46,963 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-28 08:27:46,964 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-28 08:27:46,964 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-28 08:27:46,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {34646#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {34636#false} is VALID [2022-04-28 08:27:46,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {34636#false} assume 0 == ~routine~0; {34636#false} is VALID [2022-04-28 08:27:46,965 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-28 08:27:46,965 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-28 08:27:46,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {34636#false} assume 0 != ~myIrp_PendingReturned~0; {34636#false} is VALID [2022-04-28 08:27:46,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {34636#false} assume !(0 == ~pended~0); {34636#false} is VALID [2022-04-28 08:27:46,965 INFO L272 TraceCheckUtils]: 32: Hoare triple {34636#false} call errorFn(); {34636#false} is VALID [2022-04-28 08:27:46,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {34636#false} assume !false; {34636#false} is VALID [2022-04-28 08:27:46,965 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-28 08:27:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:27:46,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399617122] [2022-04-28 08:27:46,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399617122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:27:46,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:27:46,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:27:46,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:27:46,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900585343] [2022-04-28 08:27:46,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900585343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:27:46,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:27:46,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:27:46,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17220425] [2022-04-28 08:27:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:27:46,967 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-28 08:27:46,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:27:46,967 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-28 08:27:46,998 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-28 08:27:46,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:27:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:27:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:27:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:27:46,999 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-28 08:28:03,298 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-28 08:28:06,236 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-28 08:28:08,240 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-28 08:28:10,460 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-28 08:28:12,464 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-28 08:28:20,250 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-28 08:28:28,373 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-28 08:28:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:33,022 INFO L93 Difference]: Finished difference Result 2061 states and 3001 transitions. [2022-04-28 08:28:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:28:33,022 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-28 08:28:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:28:33,023 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-28 08:28:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-28 08:28:33,070 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-28 08:28:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-28 08:28:33,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1787 transitions. [2022-04-28 08:28:35,128 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-28 08:28:35,314 INFO L225 Difference]: With dead ends: 2061 [2022-04-28 08:28:35,314 INFO L226 Difference]: Without dead ends: 1892 [2022-04-28 08:28:35,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:28:35,316 INFO L413 NwaCegarLoop]: 1098 mSDtfsCounter, 1425 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 337 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:28:35,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1779 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1504 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2022-04-28 08:28:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-04-28 08:28:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2022-04-28 08:28:35,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:28:35,447 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-28 08:28:35,449 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-28 08:28:35,452 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-28 08:28:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:35,560 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-28 08:28:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-28 08:28:35,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:35,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:35,568 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-28 08:28:35,570 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-28 08:28:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:35,742 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-28 08:28:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-28 08:28:35,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:35,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:35,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:28:35,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:28:35,773 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-28 08:28:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2381 transitions. [2022-04-28 08:28:35,921 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2381 transitions. Word has length 34 [2022-04-28 08:28:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:28:35,922 INFO L495 AbstractCegarLoop]: Abstraction has 1623 states and 2381 transitions. [2022-04-28 08:28:35,922 INFO L496 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-28 08:28:35,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1623 states and 2381 transitions. [2022-04-28 08:28:38,500 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-28 08:28:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2381 transitions. [2022-04-28 08:28:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:28:38,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:28:38,501 INFO L195 NwaCegarLoop]: 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-28 08:28:38,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:28:38,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:28:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:28:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 1 times [2022-04-28 08:28:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:28:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966894218] [2022-04-28 08:28:38,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:28:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 2 times [2022-04-28 08:28:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:28:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250404729] [2022-04-28 08:28:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:28:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:28:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:28:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:38,677 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-28 08:28:38,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-28 08:28:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:28:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:38,732 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-28 08:28:38,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-28 08:28:38,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:28:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:38,751 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-28 08:28:38,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-28 08:28:38,753 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-28 08:28:38,753 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-28 08:28:38,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-28 08:28:38,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {45810#true} call #t~ret1013 := main(); {45810#true} is VALID [2022-04-28 08:28:38,756 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-28 08:28:38,757 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-28 08:28:38,757 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-28 08:28:38,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,757 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-28 08:28:38,757 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-28 08:28:38,758 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-28 08:28:38,758 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-28 08:28:38,758 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-28 08:28:38,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-28 08:28:38,758 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-28 08:28:38,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {45810#true} assume !!(~status~15 >= 0); {45810#true} is VALID [2022-04-28 08:28:38,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {45810#true} assume !(2 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-28 08:28:38,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {45810#true} assume !(3 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-28 08:28:38,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {45810#true} assume 4 == ~__BLAST_NONDET___0~0; {45810#true} is VALID [2022-04-28 08:28:38,759 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-28 08:28:38,759 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-28 08:28:38,759 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-28 08:28:38,760 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-28 08:28:38,761 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-28 08:28:38,761 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-28 08:28:38,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:38,762 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-28 08:28:38,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:38,762 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-28 08:28:38,762 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-28 08:28:38,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {45811#false} is VALID [2022-04-28 08:28:38,763 INFO L272 TraceCheckUtils]: 32: Hoare triple {45811#false} call errorFn(); {45811#false} is VALID [2022-04-28 08:28:38,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {45811#false} assume !false; {45811#false} is VALID [2022-04-28 08:28:38,764 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-28 08:28:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:28:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250404729] [2022-04-28 08:28:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250404729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:28:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:28:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:28:38,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:28:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966894218] [2022-04-28 08:28:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966894218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:28:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:28:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:28:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846208973] [2022-04-28 08:28:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:28:38,765 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-28 08:28:38,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:28:38,765 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-28 08:28:38,793 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-28 08:28:38,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:28:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:28:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:28:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:28:38,793 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-28 08:28:52,061 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-28 08:28:57,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:00,504 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-28 08:29:05,947 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-28 08:29:07,976 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-28 08:29:10,098 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-28 08:29:13,540 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-28 08:29:16,367 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-28 08:29:18,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-28 08:29:24,421 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-28 08:29:26,920 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-28 08:29:28,947 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-28 08:29:31,303 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-28 08:29:34,791 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-28 08:29:41,575 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-28 08:29:44,727 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-28 08:29:47,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:50,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:51,074 INFO L93 Difference]: Finished difference Result 1760 states and 2607 transitions. [2022-04-28 08:29:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:29:51,074 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-28 08:29:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:29:51,074 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-28 08:29:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-28 08:29:51,085 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-28 08:29:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-28 08:29:51,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1223 transitions. [2022-04-28 08:29:52,622 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-28 08:29:52,777 INFO L225 Difference]: With dead ends: 1760 [2022-04-28 08:29:52,777 INFO L226 Difference]: Without dead ends: 1756 [2022-04-28 08:29:52,777 INFO L412 NwaCegarLoop]: 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-28 08:29:52,778 INFO L413 NwaCegarLoop]: 893 mSDtfsCounter, 903 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 360 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:29:52,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1471 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1626 Invalid, 14 Unknown, 0 Unchecked, 40.4s Time] [2022-04-28 08:29:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-04-28 08:29:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1622. [2022-04-28 08:29:52,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:29:52,979 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-28 08:29:52,980 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-28 08:29:52,982 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-28 08:29:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:53,083 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-28 08:29:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-28 08:29:53,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:29:53,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:29:53,089 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-28 08:29:53,090 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-28 08:29:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:53,186 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-28 08:29:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-28 08:29:53,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:29:53,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:29:53,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:29:53,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:29:53,191 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-28 08:29:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2378 transitions. [2022-04-28 08:29:53,329 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2378 transitions. Word has length 34 [2022-04-28 08:29:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:29:53,330 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2378 transitions. [2022-04-28 08:29:53,330 INFO L496 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-28 08:29:53,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1622 states and 2378 transitions. [2022-04-28 08:29:56,282 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-28 08:29:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2378 transitions. [2022-04-28 08:29:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 08:29:56,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:29:56,311 INFO L195 NwaCegarLoop]: 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-28 08:29:56,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:29:56,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:29:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:29:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 1 times [2022-04-28 08:29:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:56,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037451723] [2022-04-28 08:29:56,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:29:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 2 times [2022-04-28 08:29:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:29:56,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67198621] [2022-04-28 08:29:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:29:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:29:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:56,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:29:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:56,462 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-28 08:29:56,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-28 08:29:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:29:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:56,508 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-28 08:29:56,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-28 08:29:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:29:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:56,532 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-28 08:29:56,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-28 08:29:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 08:29:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:56,551 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-28 08:29:56,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-28 08:29:56,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-28 08:29:56,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-28 08:29:56,551 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-28 08:29:56,553 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-28 08:29:56,553 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-28 08:29:56,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-28 08:29:56,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {56108#true} call #t~ret1013 := main(); {56108#true} is VALID [2022-04-28 08:29:56,561 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-28 08:29:56,563 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-28 08:29:56,563 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-28 08:29:56,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,563 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-28 08:29:56,564 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-28 08:29:56,564 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-28 08:29:56,566 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-28 08:29:56,566 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-28 08:29:56,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-28 08:29:56,566 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-28 08:29:56,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {56108#true} assume !!(~status~15 >= 0); {56108#true} is VALID [2022-04-28 08:29:56,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {56108#true} assume !(2 == ~__BLAST_NONDET___0~0); {56108#true} is VALID [2022-04-28 08:29:56,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {56108#true} assume 3 == ~__BLAST_NONDET___0~0; {56108#true} is VALID [2022-04-28 08:29:56,566 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-28 08:29:56,566 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-28 08:29:56,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#true} assume 0 == #t~mem133 % 256;havoc #t~mem133; {56108#true} is VALID [2022-04-28 08:29:56,567 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-28 08:29:56,567 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-28 08:29:56,567 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-28 08:29:56,567 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-28 08:29:56,568 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-28 08:29:56,568 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-28 08:29:56,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-28 08:29:56,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-28 08:29:56,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-28 08:29:56,569 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-28 08:29:56,569 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-28 08:29:56,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {56108#true} assume !(~s~0 != ~NP~0); {56108#true} is VALID [2022-04-28 08:29:56,569 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-28 08:29:56,570 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-28 08:29:56,570 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-28 08:29:56,571 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-28 08:29:56,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56125#(not (= ~routine~0 0))} is VALID [2022-04-28 08:29:56,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {56125#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56109#false} is VALID [2022-04-28 08:29:56,572 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-28 08:29:56,572 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-28 08:29:56,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {56109#false} assume 0 != ~myIrp_PendingReturned~0; {56109#false} is VALID [2022-04-28 08:29:56,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {56109#false} assume !(0 == ~pended~0); {56109#false} is VALID [2022-04-28 08:29:56,572 INFO L272 TraceCheckUtils]: 44: Hoare triple {56109#false} call errorFn(); {56109#false} is VALID [2022-04-28 08:29:56,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {56109#false} assume !false; {56109#false} is VALID [2022-04-28 08:29:56,573 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-28 08:29:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:29:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67198621] [2022-04-28 08:29:56,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67198621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:56,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:56,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:29:56,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:29:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037451723] [2022-04-28 08:29:56,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037451723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:56,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:56,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:29:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537464470] [2022-04-28 08:29:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:29:56,575 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-28 08:29:56,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:29:56,575 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-28 08:29:56,621 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-28 08:29:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 08:29:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 08:29:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:29:56,621 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-28 08:30:15,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:22,153 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-28 08:30:24,190 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-28 08:30:26,234 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-28 08:30:31,547 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-28 08:30:39,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:44,634 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-28 08:30:52,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:56,732 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-28 08:31:00,845 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-28 08:31:03,152 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-28 08:31:11,500 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-28 08:31:13,530 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-28 08:31:15,571 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-28 08:31:20,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:24,191 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-28 08:31:28,795 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-28 08:31:33,603 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-28 08:31:35,608 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-28 08:31:39,267 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-28 08:31:41,596 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-28 08:31:44,279 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-28 08:31:50,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:54,632 INFO L93 Difference]: Finished difference Result 2729 states and 4036 transitions. [2022-04-28 08:31:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 08:31:54,633 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-28 08:31:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:31:54,634 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-28 08:31:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-28 08:31:54,665 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-28 08:31:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-28 08:31:54,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 2095 transitions. [2022-04-28 08:31:56,758 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-28 08:31:56,900 INFO L225 Difference]: With dead ends: 2729 [2022-04-28 08:31:56,900 INFO L226 Difference]: Without dead ends: 1590 [2022-04-28 08:31:56,920 INFO L412 NwaCegarLoop]: 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-28 08:31:56,922 INFO L413 NwaCegarLoop]: 893 mSDtfsCounter, 2049 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 1041 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:31:56,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 1619 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2542 Invalid, 17 Unknown, 0 Unchecked, 61.1s Time] [2022-04-28 08:31:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-04-28 08:31:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1195. [2022-04-28 08:31:57,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:31:57,048 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-28 08:31:57,050 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-28 08:31:57,051 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-28 08:31:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:57,143 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-28 08:31:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-28 08:31:57,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:57,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:57,148 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-28 08:31:57,150 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-28 08:31:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:57,251 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-28 08:31:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-28 08:31:57,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:57,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:57,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:31:57,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:31:57,256 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-28 08:31:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1731 transitions. [2022-04-28 08:31:57,332 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1731 transitions. Word has length 46 [2022-04-28 08:31:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:31:57,332 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1731 transitions. [2022-04-28 08:31:57,332 INFO L496 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-28 08:31:57,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1195 states and 1731 transitions. [2022-04-28 08:32:00,173 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-28 08:32:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1731 transitions. [2022-04-28 08:32:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 08:32:00,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:00,175 INFO L195 NwaCegarLoop]: 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-28 08:32:00,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:32:00,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 1 times [2022-04-28 08:32:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:00,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583010560] [2022-04-28 08:32:00,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:32:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 2 times [2022-04-28 08:32:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:00,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129403737] [2022-04-28 08:32:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,357 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-28 08:32:00,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:32:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,396 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-28 08:32:00,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-28 08:32:00,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:32:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,417 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-28 08:32:00,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-28 08:32:00,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-28 08:32:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:00,436 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-28 08:32:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-28 08:32:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-28 08:32:00,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-28 08:32:00,437 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,440 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-28 08:32:00,440 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-28 08:32:00,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret1013 := main(); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,441 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-28 08:32:00,442 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-28 08:32:00,442 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-28 08:32:00,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-28 08:32:00,443 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,443 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-28 08:32:00,443 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-28 08:32:00,444 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-28 08:32:00,444 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-28 08:32:00,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-28 08:32:00,444 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,444 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-28 08:32:00,445 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-28 08:32:00,445 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-28 08:32:00,445 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-28 08:32:00,446 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-28 08:32:00,446 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-28 08:32:00,446 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-28 08:32:00,451 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-28 08:32:00,451 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-28 08:32:00,452 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-28 08:32:00,453 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-28 08:32:00,453 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-28 08:32:00,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-28 08:32:00,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-28 08:32:00,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-28 08:32:00,454 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,454 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-28 08:32:00,454 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-28 08:32:00,454 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-28 08:32:00,455 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-28 08:32:00,455 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-28 08:32:00,455 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-28 08:32:00,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:32:00,456 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-28 08:32:00,457 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-28 08:32:00,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67183#false} is VALID [2022-04-28 08:32:00,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {67183#false} assume !(0 == ~pended~0); {67183#false} is VALID [2022-04-28 08:32:00,457 INFO L272 TraceCheckUtils]: 45: Hoare triple {67183#false} call errorFn(); {67183#false} is VALID [2022-04-28 08:32:00,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {67183#false} assume !false; {67183#false} is VALID [2022-04-28 08:32:00,457 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-28 08:32:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:00,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129403737] [2022-04-28 08:32:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129403737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 08:32:00,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:00,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583010560] [2022-04-28 08:32:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583010560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 08:32:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401741584] [2022-04-28 08:32:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:00,459 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-28 08:32:00,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:00,460 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-28 08:32:00,496 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-28 08:32:00,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 08:32:00,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 08:32:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:32:00,497 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-28 08:32:20,579 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-28 08:32:37,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:40,024 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-28 08:32:42,231 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-28 08:32:44,277 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-28 08:32:49,157 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-28 08:32:52,349 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-28 08:32:54,828 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-28 08:32:56,869 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-28 08:33:07,815 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-28 08:33:09,847 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-28 08:33:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:10,954 INFO L93 Difference]: Finished difference Result 2147 states and 3201 transitions. [2022-04-28 08:33:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 08:33:10,954 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-28 08:33:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:33:10,955 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-28 08:33:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-28 08:33:10,971 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-28 08:33:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-28 08:33:10,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1894 transitions. [2022-04-28 08:33:13,212 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-28 08:33:13,311 INFO L225 Difference]: With dead ends: 2147 [2022-04-28 08:33:13,312 INFO L226 Difference]: Without dead ends: 1478 [2022-04-28 08:33:13,313 INFO L412 NwaCegarLoop]: 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-28 08:33:13,313 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1787 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 753 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:33:13,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 1168 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2298 Invalid, 9 Unknown, 0 Unchecked, 33.6s Time] [2022-04-28 08:33:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-04-28 08:33:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1192. [2022-04-28 08:33:13,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:33:13,452 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-28 08:33:13,453 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-28 08:33:13,455 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-28 08:33:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:13,535 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-28 08:33:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-28 08:33:13,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:13,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:13,540 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-28 08:33:13,542 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-28 08:33:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:33:13,614 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-28 08:33:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-28 08:33:13,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:33:13,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:33:13,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:33:13,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:33:13,618 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-28 08:33:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1720 transitions. [2022-04-28 08:33:13,709 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1720 transitions. Word has length 47 [2022-04-28 08:33:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:33:13,709 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1720 transitions. [2022-04-28 08:33:13,709 INFO L496 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-28 08:33:13,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1192 states and 1720 transitions. [2022-04-28 08:33:16,148 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-28 08:33:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1720 transitions. [2022-04-28 08:33:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 08:33:16,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:33:16,149 INFO L195 NwaCegarLoop]: 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-28 08:33:16,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:33:16,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:33:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:33:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 1 times [2022-04-28 08:33:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:16,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172314028] [2022-04-28 08:33:16,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:33:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 2 times [2022-04-28 08:33:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:33:16,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212240205] [2022-04-28 08:33:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:33:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:33:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:33:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,290 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-28 08:33:16,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-28 08:33:16,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-28 08:33:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:33:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,326 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-28 08:33:16,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:33:16,327 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-28 08:33:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:33:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,347 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-28 08:33:16,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-28 08:33:16,348 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-28 08:33:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 08:33:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 08:33:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:33:16,423 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-28 08:33:16,423 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-28 08:33:16,423 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-28 08:33:16,423 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-28 08:33:16,424 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-28 08:33:16,424 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-28 08:33:16,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:33:16,425 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-28 08:33:16,425 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-28 08:33:16,426 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-28 08:33:16,426 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-28 08:33:16,427 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-28 08:33:16,427 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-28 08:33:16,428 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-28 08:33:16,429 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-28 08:33:16,430 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-28 08:33:16,432 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-28 08:33:16,432 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-28 08:33:16,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:33:16,433 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-28 08:33:16,433 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-28 08:33:16,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:33:16,434 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-28 08:33:16,435 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-28 08:33:16,435 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-28 08:33:16,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-28 08:33:16,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-28 08:33:16,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {76852#true} call #t~ret1013 := main(); {76852#true} is VALID [2022-04-28 08:33:16,436 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-28 08:33:16,437 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-28 08:33:16,437 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-28 08:33:16,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:33:16,438 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-28 08:33:16,438 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-28 08:33:16,438 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-28 08:33:16,439 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-28 08:33:16,439 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-28 08:33:16,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-28 08:33:16,439 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-28 08:33:16,439 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-28 08:33:16,440 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-28 08:33:16,440 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-28 08:33:16,440 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-28 08:33:16,441 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-28 08:33:16,441 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-28 08:33:16,441 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-28 08:33:16,442 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-28 08:33:16,443 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-28 08:33:16,443 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-28 08:33:16,443 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-28 08:33:16,443 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-28 08:33:16,444 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-28 08:33:16,444 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-28 08:33:16,444 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-28 08:33:16,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:33:16,445 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-28 08:33:16,445 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-28 08:33:16,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:33:16,446 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-28 08:33:16,446 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-28 08:33:16,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {76853#false} assume 0 != ~we_should_unload~0; {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {76853#false} assume !(~s~0 == ~UNLOADED~0); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {76853#false} assume !(-1 == ~status~15); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {76853#false} assume !(~s~0 != ~SKIP2~0); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {76853#false} assume 1 == ~pended~0; {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {76853#false} assume 259 != ~status~15; {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L272 TraceCheckUtils]: 45: Hoare triple {76853#false} call errorFn(); {76853#false} is VALID [2022-04-28 08:33:16,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {76853#false} assume !false; {76853#false} is VALID [2022-04-28 08:33:16,448 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-28 08:33:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:33:16,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212240205] [2022-04-28 08:33:16,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212240205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:16,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:16,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:33:16,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:33:16,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172314028] [2022-04-28 08:33:16,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172314028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:33:16,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:33:16,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:33:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460598157] [2022-04-28 08:33:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:33:16,449 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-28 08:33:16,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:33:16,450 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-28 08:33:16,485 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-28 08:33:16,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 08:33:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:33:16,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 08:33:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:33:16,485 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-28 08:33:52,465 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-28 08:33:54,503 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-28 08:33:56,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:58,589 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-28 08:34:07,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:09,786 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-28 08:34:17,099 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-28 08:34:19,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:21,783 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-28 08:34:25,011 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-28 08:34:32,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:39,056 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-28 08:34:47,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-28 08:34:51,525 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-28 08:34:58,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:02,941 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-28 08:35:04,988 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-28 08:35:07,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:23,001 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-28 08:35:26,080 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-28 08:35:29,251 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-28 08:35:31,287 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-28 08:35:35,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:41,200 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-28 08:35:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:49,751 INFO L93 Difference]: Finished difference Result 1825 states and 2709 transitions. [2022-04-28 08:35:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 08:35:49,752 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-28 08:35:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:49,752 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-28 08:35:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-28 08:35:49,766 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-28 08:35:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-28 08:35:49,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 1912 transitions. [2022-04-28 08:35:52,183 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-28 08:35:52,335 INFO L225 Difference]: With dead ends: 1825 [2022-04-28 08:35:52,335 INFO L226 Difference]: Without dead ends: 1764 [2022-04-28 08:35:52,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2022-04-28 08:35:52,336 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 2875 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 1401 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 5762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1401 IncrementalHoareTripleChecker+Valid, 4345 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:52,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 2799 Invalid, 5762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1401 Valid, 4345 Invalid, 16 Unknown, 0 Unchecked, 65.8s Time] [2022-04-28 08:35:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-28 08:35:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1264. [2022-04-28 08:35:52,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:52,546 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-28 08:35:52,547 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-28 08:35:52,548 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-28 08:35:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:52,645 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-28 08:35:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-28 08:35:52,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:52,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:52,652 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-28 08:35:52,653 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-28 08:35:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:52,753 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-28 08:35:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-28 08:35:52,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:52,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:52,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:52,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:52,759 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-28 08:35:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1808 transitions. [2022-04-28 08:35:52,831 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1808 transitions. Word has length 47 [2022-04-28 08:35:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:52,831 INFO L495 AbstractCegarLoop]: Abstraction has 1264 states and 1808 transitions. [2022-04-28 08:35:52,831 INFO L496 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-28 08:35:52,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1264 states and 1808 transitions. [2022-04-28 08:35:56,316 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-28 08:35:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1808 transitions. [2022-04-28 08:35:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:35:56,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:56,318 INFO L195 NwaCegarLoop]: 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-28 08:35:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:35:56,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 1 times [2022-04-28 08:35:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145446151] [2022-04-28 08:35:56,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:35:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 2 times [2022-04-28 08:35:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665015602] [2022-04-28 08:35:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,445 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-28 08:35:56,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-28 08:35:56,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-28 08:35:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:35:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,489 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-28 08:35:56,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-28 08:35:56,490 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-28 08:35:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:35:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,514 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-28 08:35:56,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-28 08:35:56,515 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-28 08:35:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 08:35:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 08:35:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:56,570 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-28 08:35:56,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-28 08:35:56,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-28 08:35:56,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-28 08:35:56,571 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-28 08:35:56,572 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-28 08:35:56,572 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-28 08:35:56,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-28 08:35:56,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-28 08:35:56,572 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-28 08:35:56,573 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-28 08:35:56,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-28 08:35:56,573 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-28 08:35:56,574 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-28 08:35:56,574 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-28 08:35:56,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-28 08:35:56,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-28 08:35:56,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-28 08:35:56,575 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-28 08:35:56,576 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-28 08:35:56,576 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-28 08:35:56,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-28 08:35:56,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-28 08:35:56,576 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-28 08:35:56,576 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-28 08:35:56,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-28 08:35:56,576 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-28 08:35:56,578 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-28 08:35:56,578 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-28 08:35:56,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-28 08:35:56,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-28 08:35:56,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {86635#true} call #t~ret1013 := main(); {86635#true} is VALID [2022-04-28 08:35:56,578 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-28 08:35:56,579 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-28 08:35:56,580 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-28 08:35:56,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-28 08:35:56,580 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-28 08:35:56,580 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-28 08:35:56,581 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-28 08:35:56,581 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-28 08:35:56,581 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-28 08:35:56,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-28 08:35:56,582 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-28 08:35:56,582 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-28 08:35:56,582 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-28 08:35:56,583 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-28 08:35:56,583 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-28 08:35:56,584 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-28 08:35:56,584 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-28 08:35:56,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-28 08:35:56,584 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-28 08:35:56,585 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-28 08:35:56,585 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-28 08:35:56,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-28 08:35:56,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-28 08:35:56,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-28 08:35:56,586 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-28 08:35:56,586 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-28 08:35:56,586 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-28 08:35:56,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-28 08:35:56,587 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-28 08:35:56,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-28 08:35:56,587 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-28 08:35:56,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {86636#false} assume 0 != ~we_should_unload~0; {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {86636#false} assume !(~s~0 == ~UNLOADED~0); {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {86636#false} assume !(-1 == ~status~15); {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {86636#false} assume !(~s~0 != ~SKIP2~0); {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {86636#false} assume 1 == ~pended~0; {86636#false} is VALID [2022-04-28 08:35:56,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {86636#false} assume 259 != ~status~15; {86636#false} is VALID [2022-04-28 08:35:56,588 INFO L272 TraceCheckUtils]: 47: Hoare triple {86636#false} call errorFn(); {86636#false} is VALID [2022-04-28 08:35:56,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {86636#false} assume !false; {86636#false} is VALID [2022-04-28 08:35:56,588 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-28 08:35:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:56,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665015602] [2022-04-28 08:35:56,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665015602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:56,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:56,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:35:56,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:56,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145446151] [2022-04-28 08:35:56,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145446151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:56,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:56,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:35:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428807395] [2022-04-28 08:35:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:56,589 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-28 08:35:56,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:56,590 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-28 08:35:56,628 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-28 08:35:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 08:35:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 08:35:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:35:56,629 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) [2022-04-28 08:36:12,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-28 08:36:20,767 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-28 08:36:22,776 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-28 08:36:32,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:36,476 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-28 08:36:38,508 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-28 08:36:44,228 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-28 08:36:49,052 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-28 08:36:51,093 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-28 08:36:53,287 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-28 08:36:59,139 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-28 08:37:01,183 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-28 08:37:03,850 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-28 08:37:07,913 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-28 08:37:13,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:37:15,357 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 []