/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:01:56,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:01:56,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:01:56,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:01:56,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:01:56,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:01:56,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:01:56,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:01:56,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:01:56,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:01:56,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:01:56,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:01:56,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:01:56,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:01:56,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:01:56,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:01:56,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:01:56,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:01:56,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:01:56,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:01:56,899 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:01:56,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:01:56,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:01:56,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:01:56,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:01:56,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:01:56,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:01:56,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:01:56,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:01:56,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:01:56,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:01:56,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:01:56,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:01:56,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:01:56,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:01:56,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:01:56,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:01:56,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:01:56,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:01:56,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:01:56,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:01:56,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:01:56,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:01:56,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:01:56,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:01:56,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:01:56,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:01:56,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:56,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:01:56,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:01:56,917 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 15:01:57,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:01:57,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:01:57,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:01:57,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:01:57,098 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:01:57,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-28 15:01:57,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9a2384c/66c56fea90d94034b3c3f7591ccce120/FLAGd08f684cf [2022-04-28 15:01:57,733 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:01:57,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-28 15:01:57,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9a2384c/66c56fea90d94034b3c3f7591ccce120/FLAGd08f684cf [2022-04-28 15:01:57,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb9a2384c/66c56fea90d94034b3c3f7591ccce120 [2022-04-28 15:01:57,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:01:57,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:01:57,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:57,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:01:57,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:01:57,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:57" (1/1) ... [2022-04-28 15:01:57,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d92670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:57, skipping insertion in model container [2022-04-28 15:01:57,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:57" (1/1) ... [2022-04-28 15:01:57,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:01:57,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:01:58,402 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-1.c[90162,90175] [2022-04-28 15:01:58,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:58,977 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:01:59,021 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-1.c[90162,90175] [2022-04-28 15:01:59,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:59,317 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:01:59,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59 WrapperNode [2022-04-28 15:01:59,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:59,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:01:59,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:01:59,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:01:59,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:01:59,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:01:59,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:01:59,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:01:59,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (1/1) ... [2022-04-28 15:01:59,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:59,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:01:59,657 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 15:01:59,663 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 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-28 15:01:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-28 15:01:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-28 15:01:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-28 15:01:59,686 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-28 15:01:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-28 15:01:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-28 15:01:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-28 15:01:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-28 15:01:59,687 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 15:01:59,691 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-28 15:01:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-28 15:01:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-28 15:01:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-28 15:01:59,694 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-28 15:01:59,694 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-28 15:01:59,694 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-28 15:01:59,694 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-28 15:01:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-28 15:01:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-28 15:01:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-28 15:01:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-28 15:01:59,695 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-28 15:01:59,696 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-28 15:01:59,696 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-28 15:01:59,696 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-28 15:01:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:01:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-28 15:01:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-28 15:01:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-28 15:01:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-28 15:01:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-28 15:01:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-28 15:01:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-28 15:01:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-28 15:01:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-28 15:01:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-28 15:01:59,707 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-28 15:01:59,708 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:01:59,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:01:59,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:02:00,231 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:02:00,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:02:00,265 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:00,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:00,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:00,295 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:00,306 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:00,306 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:00,313 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:00,322 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:00,322 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:00,322 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:00,352 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:00,352 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:00,354 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:06,841 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 15:02:06,841 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 15:02:06,854 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:06,861 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:06,861 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:06,861 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:06,870 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:06,870 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:06,871 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:06,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:06,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:06,885 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:06,900 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:06,900 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:06,903 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:13,913 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 15:02:13,913 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 15:02:13,968 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,105 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-28 15:02:14,106 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-28 15:02:14,112 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,130 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:14,131 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:14,131 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-28 15:02:14,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-28 15:02:14,153 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,158 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:14,158 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:14,158 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,166 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:14,166 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:14,180 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,186 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:14,186 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:14,186 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:14,194 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:14,194 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:14,549 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:17,698 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 15:02:17,699 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 15:02:17,706 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:21,818 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-28 15:02:21,818 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-28 15:02:21,826 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:21,851 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-28 15:02:21,851 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-28 15:02:21,876 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:21,880 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:21,881 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:21,922 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:22,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2022-04-28 15:02:22,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2022-04-28 15:02:22,120 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:22,124 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:22,124 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:22,207 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:22,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:22,224 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:22,225 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,533 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 15:02:27,533 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 15:02:27,537 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,560 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-28 15:02:27,560 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-28 15:02:27,569 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,578 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-28 15:02:27,578 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-28 15:02:27,588 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,593 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:27,593 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:27,889 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,942 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-28 15:02:27,942 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-28 15:02:27,942 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-28 15:02:27,942 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:27,947 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 15:02:27,948 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 15:02:28,007 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:02:34,475 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 15:02:34,476 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 15:02:34,526 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:02:34,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:02:34,540 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-28 15:02:34,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:02:34 BoogieIcfgContainer [2022-04-28 15:02:34,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:02:34,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:02:34,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:02:34,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:02:34,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:57" (1/3) ... [2022-04-28 15:02:34,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:02:34, skipping insertion in model container [2022-04-28 15:02:34,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:59" (2/3) ... [2022-04-28 15:02:34,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6d2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:02:34, skipping insertion in model container [2022-04-28 15:02:34,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:02:34" (3/3) ... [2022-04-28 15:02:34,552 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2022-04-28 15:02:34,562 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:02:34,562 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:02:34,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:02:34,623 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@35eda1c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16c184a4 [2022-04-28 15:02:34,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:02:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 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 15:02:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:34,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:34,649 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] [2022-04-28 15:02:34,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 1 times [2022-04-28 15:02:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:34,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1721953965] [2022-04-28 15:02:34,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 2 times [2022-04-28 15:02:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:34,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652121162] [2022-04-28 15:02:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:35,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {1264#true} is VALID [2022-04-28 15:02:35,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 15:02:35,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-28 15:02:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:02:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:35,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:02:35,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {1264#true} is VALID [2022-04-28 15:02:35,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 15:02:35,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-28 15:02:35,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret1021 := main(); {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 93); {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 68); {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 904); {1264#true} is VALID [2022-04-28 15:02:35,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1264#true} is VALID [2022-04-28 15:02:35,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {1264#true} call _BLAST_init(); {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:02:35,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 15:02:35,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1265#false} is VALID [2022-04-28 15:02:35,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#false} assume !(-1 == ~status~15); {1265#false} is VALID [2022-04-28 15:02:35,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#false} assume !(~s~0 != ~SKIP2~0); {1265#false} is VALID [2022-04-28 15:02:35,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {1265#false} assume !(1 == ~pended~0); {1265#false} is VALID [2022-04-28 15:02:35,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {1265#false} assume ~s~0 == ~DC~0; {1265#false} is VALID [2022-04-28 15:02:35,203 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#false} call errorFn(); {1265#false} is VALID [2022-04-28 15:02:35,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-28 15:02:35,204 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 15:02:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:35,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652121162] [2022-04-28 15:02:35,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652121162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:35,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:35,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:02:35,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:35,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1721953965] [2022-04-28 15:02:35,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1721953965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:35,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:35,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:02:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870897412] [2022-04-28 15:02:35,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:35,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 26 [2022-04-28 15:02:35,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:35,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:02:35,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:35,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:02:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:35,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:02:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:35,278 INFO L87 Difference]: Start difference. First operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 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 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:02:47,753 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 15:02:52,206 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 15:02:58,916 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 15:03:03,289 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 15:03:10,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:03:12,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:03:19,693 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 15:03:23,947 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 15:03:33,112 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 15:03:38,060 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 15:03:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:38,825 INFO L93 Difference]: Finished difference Result 1537 states and 2438 transitions. [2022-04-28 15:03:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 15:03:38,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 26 [2022-04-28 15:03:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:03:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-28 15:03:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:03:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-28 15:03:38,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2438 transitions. [2022-04-28 15:03:41,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2438 edges. 2438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:41,823 INFO L225 Difference]: With dead ends: 1537 [2022-04-28 15:03:41,823 INFO L226 Difference]: Without dead ends: 842 [2022-04-28 15:03:41,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:03:41,836 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 484 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 187 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:03:41,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1302 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1973 Invalid, 7 Unknown, 0 Unchecked, 28.0s Time] [2022-04-28 15:03:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-28 15:03:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 679. [2022-04-28 15:03:41,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:41,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 15:03:41,939 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 15:03:41,940 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 15:03:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:41,981 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-28 15:03:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-28 15:03:41,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:41,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:41,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 842 states. [2022-04-28 15:03:41,995 INFO L87 Difference]: Start difference. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 842 states. [2022-04-28 15:03:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:42,031 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-28 15:03:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-28 15:03:42,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:42,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:42,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:42,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 15:03:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 991 transitions. [2022-04-28 15:03:42,067 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 991 transitions. Word has length 26 [2022-04-28 15:03:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:42,067 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 991 transitions. [2022-04-28 15:03:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:03:42,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 991 transitions. [2022-04-28 15:03:43,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 991 transitions. [2022-04-28 15:03:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:03:43,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:03:43,197 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] [2022-04-28 15:03:43,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:03:43,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:03:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:03:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 1 times [2022-04-28 15:03:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743740984] [2022-04-28 15:03:43,199 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:03:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 2 times [2022-04-28 15:03:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:03:43,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088688329] [2022-04-28 15:03:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:03:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:03:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:43,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:03:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:43,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {7398#true} is VALID [2022-04-28 15:03:43,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 15:03:43,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-28 15:03:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:03:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:43,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {7398#true} is VALID [2022-04-28 15:03:43,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 15:03:43,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-28 15:03:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:03:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:03:43,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {7398#true} call ULTIMATE.init(); {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:03:43,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {7398#true} is VALID [2022-04-28 15:03:43,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 15:03:43,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-28 15:03:43,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#true} call #t~ret1021 := main(); {7398#true} is VALID [2022-04-28 15:03:43,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {7398#true} is VALID [2022-04-28 15:03:43,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 93); {7398#true} is VALID [2022-04-28 15:03:43,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-28 15:03:43,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 68); {7398#true} is VALID [2022-04-28 15:03:43,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-28 15:03:43,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 904); {7398#true} is VALID [2022-04-28 15:03:43,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7398#true} is VALID [2022-04-28 15:03:43,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {7398#true} call _BLAST_init(); {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:03:43,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {7398#true} is VALID [2022-04-28 15:03:43,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 15:03:43,449 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-28 15:03:43,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {7398#true} is VALID [2022-04-28 15:03:43,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {7398#true} is VALID [2022-04-28 15:03:43,451 INFO L272 TraceCheckUtils]: 18: Hoare triple {7398#true} call stub_driver_init(); {7412#(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 15:03:43,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {7412#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,452 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {7409#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,454 INFO L272 TraceCheckUtils]: 26: Hoare triple {7409#(= ~s~0 ~NP~0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(= ~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; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:03:43,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7399#false} is VALID [2022-04-28 15:03:43,454 INFO L272 TraceCheckUtils]: 29: Hoare triple {7399#false} call errorFn(); {7399#false} is VALID [2022-04-28 15:03:43,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-04-28 15:03:43,455 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 15:03:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:03:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088688329] [2022-04-28 15:03:43,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088688329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:43,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:43,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:03:43,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:03:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743740984] [2022-04-28 15:03:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743740984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:03:43,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:03:43,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:03:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614384819] [2022-04-28 15:03:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:03:43,458 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), 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 31 [2022-04-28 15:03:43,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:03:43,459 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), 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 15:03:43,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:03:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:03:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:03:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:03:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:03:43,490 INFO L87 Difference]: Start difference. First operand 679 states and 991 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 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 15:04:00,292 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 15:04:04,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:13,419 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 15:04:16,156 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 15:04:17,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:21,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:23,770 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 15:04:27,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:29,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:34,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:04:36,055 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 15:04:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:36,865 INFO L93 Difference]: Finished difference Result 1457 states and 2151 transitions. [2022-04-28 15:04:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:04:36,865 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), 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 31 [2022-04-28 15:04:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:04:36,866 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), 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 15:04:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-28 15:04:36,885 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), 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 15:04:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-28 15:04:36,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2151 transitions. [2022-04-28 15:04:39,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2151 edges. 2151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:39,409 INFO L225 Difference]: With dead ends: 1457 [2022-04-28 15:04:39,409 INFO L226 Difference]: Without dead ends: 1180 [2022-04-28 15:04:39,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 15:04:39,411 INFO L413 NwaCegarLoop]: 1194 mSDtfsCounter, 1465 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 360 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:04:39,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1913 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2621 Invalid, 5 Unknown, 0 Unchecked, 25.8s Time] [2022-04-28 15:04:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-04-28 15:04:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 991. [2022-04-28 15:04:39,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:04:39,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 15:04:39,484 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 15:04:39,486 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 15:04:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:39,538 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-28 15:04:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-28 15:04:39,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:39,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:39,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 1180 states. [2022-04-28 15:04:39,545 INFO L87 Difference]: Start difference. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 1180 states. [2022-04-28 15:04:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:39,601 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-28 15:04:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-28 15:04:39,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:04:39,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:04:39,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:04:39,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:04:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 15:04:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1448 transitions. [2022-04-28 15:04:39,661 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1448 transitions. Word has length 31 [2022-04-28 15:04:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:04:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1448 transitions. [2022-04-28 15:04:39,662 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), 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 15:04:39,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1448 transitions. [2022-04-28 15:04:41,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1448 transitions. [2022-04-28 15:04:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 15:04:41,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:04:41,495 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] [2022-04-28 15:04:41,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:04:41,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:04:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:04:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 1 times [2022-04-28 15:04:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791488129] [2022-04-28 15:04:41,496 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:04:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 2 times [2022-04-28 15:04:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:04:41,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929205351] [2022-04-28 15:04:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:04:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:04:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:04:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:41,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {14677#true} is VALID [2022-04-28 15:04:41,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-28 15:04:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:04:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:41,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {14677#true} is VALID [2022-04-28 15:04:41,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-28 15:04:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:04:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:41,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {14691#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14677#true} is VALID [2022-04-28 15:04:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-28 15:04:41,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {14677#true} call ULTIMATE.init(); {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:04:41,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {14677#true} is VALID [2022-04-28 15:04:41,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {14677#true} call #t~ret1021 := main(); {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {14677#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 93); {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 68); {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 904); {14677#true} is VALID [2022-04-28 15:04:41,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {14677#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14677#true} is VALID [2022-04-28 15:04:41,736 INFO L272 TraceCheckUtils]: 12: Hoare triple {14677#true} call _BLAST_init(); {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:04:41,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {14677#true} is VALID [2022-04-28 15:04:41,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,737 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-28 15:04:41,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {14677#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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {14677#true} is VALID [2022-04-28 15:04:41,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {14677#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {14677#true} is VALID [2022-04-28 15:04:41,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {14677#true} call stub_driver_init(); {14691#(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 15:04:41,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14677#true} is VALID [2022-04-28 15:04:41,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 15:04:41,738 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-28 15:04:41,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {14677#true} assume !!(~status~15 >= 0); {14677#true} is VALID [2022-04-28 15:04:41,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {14677#true} assume !(2 == ~__BLAST_NONDET___0~0); {14677#true} is VALID [2022-04-28 15:04:41,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {14677#true} assume 3 == ~__BLAST_NONDET___0~0; {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L272 TraceCheckUtils]: 25: Hoare triple {14677#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {14677#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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {14677#true} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {14677#true} assume 22 == #t~mem131 % 256;havoc #t~mem131; {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#true} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {14677#true} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L272 TraceCheckUtils]: 31: Hoare triple {14677#true} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14677#true} is VALID [2022-04-28 15:04:41,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {14677#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~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {14677#true} is VALID [2022-04-28 15:04:41,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {14677#true} assume !(~s~0 == ~MPR3~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:04:41,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:04:41,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14678#false} is VALID [2022-04-28 15:04:41,747 INFO L272 TraceCheckUtils]: 36: Hoare triple {14678#false} call errorFn(); {14678#false} is VALID [2022-04-28 15:04:41,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {14678#false} assume !false; {14678#false} is VALID [2022-04-28 15:04:41,747 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 15:04:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:04:41,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929205351] [2022-04-28 15:04:41,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929205351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:41,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:41,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:04:41,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:04:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791488129] [2022-04-28 15:04:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791488129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:41,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:41,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:04:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81143880] [2022-04-28 15:04:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:04:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-04-28 15:04:41,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:04:41,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 15:04:41,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:04:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:04:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:04:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:04:41,778 INFO L87 Difference]: Start difference. First operand 991 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 15:04:52,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 15:04:59,467 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 15:05:07,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:09,829 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 15:05:16,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:20,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:22,121 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 15:05:31,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:36,097 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 15:05:38,122 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 15:05:43,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:46,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:05:52,309 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 15:05:55,816 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 15:06:01,007 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 15:06:03,954 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 15:06:08,864 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 15:06:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:14,216 INFO L93 Difference]: Finished difference Result 2293 states and 3447 transitions. [2022-04-28 15:06:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 15:06:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-04-28 15:06:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:06:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 15:06:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-28 15:06:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 15:06:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-28 15:06:14,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2367 transitions. [2022-04-28 15:06:17,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2367 edges. 2367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:17,178 INFO L225 Difference]: With dead ends: 2293 [2022-04-28 15:06:17,178 INFO L226 Difference]: Without dead ends: 1837 [2022-04-28 15:06:17,180 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 15:06:17,180 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 1584 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 517 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:06:17,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 2171 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2332 Invalid, 10 Unknown, 0 Unchecked, 43.5s Time] [2022-04-28 15:06:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-04-28 15:06:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1172. [2022-04-28 15:06:17,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:06:17,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 15:06:17,301 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 15:06:17,303 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 15:06:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:17,414 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-28 15:06:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-28 15:06:17,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:17,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:17,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 1837 states. [2022-04-28 15:06:17,423 INFO L87 Difference]: Start difference. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 1837 states. [2022-04-28 15:06:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:06:17,536 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-28 15:06:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-28 15:06:17,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:06:17,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:06:17,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:06:17,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:06:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 15:06:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1733 transitions. [2022-04-28 15:06:17,636 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1733 transitions. Word has length 38 [2022-04-28 15:06:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:06:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1733 transitions. [2022-04-28 15:06:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 15:06:17,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1172 states and 1733 transitions. [2022-04-28 15:06:20,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1733 transitions. [2022-04-28 15:06:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 15:06:20,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:06:20,017 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] [2022-04-28 15:06:20,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:06:20,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:06:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:06:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 1 times [2022-04-28 15:06:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:06:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524930414] [2022-04-28 15:06:20,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:06:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 2 times [2022-04-28 15:06:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:06:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488839046] [2022-04-28 15:06:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:06:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:06:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:06:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:20,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {25303#true} is VALID [2022-04-28 15:06:20,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-28 15:06:20,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-28 15:06:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:06:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:20,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:06:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:06:20,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {25318#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:06:20,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:06:20,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {25303#true} call ULTIMATE.init(); {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:06:20,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {25303#true} is VALID [2022-04-28 15:06:20,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-28 15:06:20,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-28 15:06:20,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {25303#true} call #t~ret1021 := main(); {25303#true} is VALID [2022-04-28 15:06:20,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {25303#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {25303#true} is VALID [2022-04-28 15:06:20,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 93); {25303#true} is VALID [2022-04-28 15:06:20,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-28 15:06:20,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 68); {25303#true} is VALID [2022-04-28 15:06:20,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-28 15:06:20,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 904); {25303#true} is VALID [2022-04-28 15:06:20,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {25303#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {25303#true} is VALID [2022-04-28 15:06:20,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {25303#true} call _BLAST_init(); {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:06:20,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {25311#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 15:06:20,351 INFO L272 TraceCheckUtils]: 18: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {25318#(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 15:06:20,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {25318#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:06:20,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 15:06:20,352 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,354 INFO L272 TraceCheckUtils]: 25: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {25315#(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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem131 % 256;havoc #t~mem131; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,357 INFO L272 TraceCheckUtils]: 31: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {25315#(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~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 15:06:20,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-28 15:06:20,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {25304#false} assume !(1 == ~setEventCalled~0); {25304#false} is VALID [2022-04-28 15:06:20,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {25304#false} assume !(1 == ~customIrp~0); {25304#false} is VALID [2022-04-28 15:06:20,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {25304#false} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-28 15:06:20,358 INFO L272 TraceCheckUtils]: 37: Hoare triple {25304#false} call errorFn(); {25304#false} is VALID [2022-04-28 15:06:20,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {25304#false} assume !false; {25304#false} is VALID [2022-04-28 15:06:20,359 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 15:06:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:06:20,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488839046] [2022-04-28 15:06:20,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488839046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:06:20,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:06:20,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 15:06:20,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:06:20,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1524930414] [2022-04-28 15:06:20,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1524930414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:06:20,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:06:20,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 15:06:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437615776] [2022-04-28 15:06:20,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:06:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 39 [2022-04-28 15:06:20,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:06:20,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 15:06:20,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:06:20,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 15:06:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:06:20,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 15:06:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 15:06:20,393 INFO L87 Difference]: Start difference. First operand 1172 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 15:06:42,655 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 15:06:46,462 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 15:06:53,282 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 15:06:59,861 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 15:07:05,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:07:11,313 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 15:07:13,339 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 15:07:15,372 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 15:07:17,397 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 15:07:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:07:18,036 INFO L93 Difference]: Finished difference Result 2221 states and 3345 transitions. [2022-04-28 15:07:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 15:07:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 39 [2022-04-28 15:07:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:07:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 15:07:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-28 15:07:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 15:07:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-28 15:07:18,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2779 transitions. [2022-04-28 15:07:21,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2779 edges. 2779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:07:21,258 INFO L225 Difference]: With dead ends: 2221 [2022-04-28 15:07:21,258 INFO L226 Difference]: Without dead ends: 1514 [2022-04-28 15:07:21,260 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 15:07:21,260 INFO L413 NwaCegarLoop]: 1366 mSDtfsCounter, 3775 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 1388 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1388 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:07:21,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3806 Valid, 2600 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1388 Valid, 1614 Invalid, 7 Unknown, 0 Unchecked, 25.2s Time] [2022-04-28 15:07:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-04-28 15:07:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1166. [2022-04-28 15:07:21,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:07:21,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 15:07:21,360 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 15:07:21,361 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 15:07:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:07:21,432 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-28 15:07:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-28 15:07:21,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:07:21,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:07:21,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 1514 states. [2022-04-28 15:07:21,439 INFO L87 Difference]: Start difference. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 1514 states. [2022-04-28 15:07:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:07:21,510 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-28 15:07:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-28 15:07:21,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:07:21,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:07:21,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:07:21,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:07:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 15:07:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1721 transitions. [2022-04-28 15:07:21,596 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1721 transitions. Word has length 39 [2022-04-28 15:07:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:07:21,597 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1721 transitions. [2022-04-28 15:07:21,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 15:07:21,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1166 states and 1721 transitions. [2022-04-28 15:07:24,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:07:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1721 transitions. [2022-04-28 15:07:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 15:07:24,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:07:24,225 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] [2022-04-28 15:07:24,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:07:24,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:07:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:07:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 1 times [2022-04-28 15:07:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:07:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582282643] [2022-04-28 15:07:24,226 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:07:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 2 times [2022-04-28 15:07:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:07:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240024369] [2022-04-28 15:07:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:07:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:07:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:07:24,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:07:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:07:24,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {35141#true} is VALID [2022-04-28 15:07:24,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 15:07:24,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-28 15:07:24,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:07:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:07:24,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {35141#true} is VALID [2022-04-28 15:07:24,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 15:07:24,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-28 15:07:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:07:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:07:24,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {35155#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {35141#true} call ULTIMATE.init(); {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:07:24,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {35141#true} call #t~ret1021 := main(); {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {35141#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 93); {35141#true} is VALID [2022-04-28 15:07:24,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-28 15:07:24,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 68); {35141#true} is VALID [2022-04-28 15:07:24,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-28 15:07:24,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 904); {35141#true} is VALID [2022-04-28 15:07:24,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {35141#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {35141#true} is VALID [2022-04-28 15:07:24,524 INFO L272 TraceCheckUtils]: 12: Hoare triple {35141#true} call _BLAST_init(); {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:07:24,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {35141#true} is VALID [2022-04-28 15:07:24,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 15:07:24,524 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-28 15:07:24,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {35141#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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {35141#true} is VALID [2022-04-28 15:07:24,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {35141#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {35141#true} is VALID [2022-04-28 15:07:24,525 INFO L272 TraceCheckUtils]: 18: Hoare triple {35141#true} call stub_driver_init(); {35155#(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 15:07:24,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {35155#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {35152#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {35152#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,532 INFO L272 TraceCheckUtils]: 26: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {35152#(= ~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; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {35152#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,533 INFO L272 TraceCheckUtils]: 30: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {35152#(= ~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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 15:07:24,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {35152#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {35142#false} is VALID [2022-04-28 15:07:24,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {35142#false} assume 0 == ~routine~0; {35142#false} is VALID [2022-04-28 15:07:24,534 INFO L272 TraceCheckUtils]: 34: Hoare triple {35142#false} call #t~ret1012 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {35142#false} is VALID [2022-04-28 15:07:24,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {35142#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; {35142#false} is VALID [2022-04-28 15:07:24,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {35142#false} assume 0 != ~myIrp_PendingReturned~0; {35142#false} is VALID [2022-04-28 15:07:24,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {35142#false} assume !(0 == ~pended~0); {35142#false} is VALID [2022-04-28 15:07:24,535 INFO L272 TraceCheckUtils]: 38: Hoare triple {35142#false} call errorFn(); {35142#false} is VALID [2022-04-28 15:07:24,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {35142#false} assume !false; {35142#false} is VALID [2022-04-28 15:07:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:07:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:07:24,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240024369] [2022-04-28 15:07:24,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240024369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:07:24,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:07:24,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:07:24,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:07:24,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582282643] [2022-04-28 15:07:24,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582282643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:07:24,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:07:24,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:07:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358762185] [2022-04-28 15:07:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:07:24,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 40 [2022-04-28 15:07:24,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:07:24,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 15:07:24,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:07:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:07:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:07:24,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:07:24,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:07:24,571 INFO L87 Difference]: Start difference. First operand 1166 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 15:07:40,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:07:44,053 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 15:07:47,532 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 15:07:54,032 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 15:08:01,565 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 15:08:07,838 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 15:08:09,843 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 15:08:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:08:11,131 INFO L93 Difference]: Finished difference Result 2067 states and 3010 transitions. [2022-04-28 15:08:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:08:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 40 [2022-04-28 15:08:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:08:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 15:08:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-28 15:08:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 15:08:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-28 15:08:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1796 transitions. [2022-04-28 15:08:13,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1796 edges. 1796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:08:13,321 INFO L225 Difference]: With dead ends: 2067 [2022-04-28 15:08:13,321 INFO L226 Difference]: Without dead ends: 1899 [2022-04-28 15:08:13,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 15:08:13,322 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 1444 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 334 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:08:13,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1824 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1520 Invalid, 6 Unknown, 0 Unchecked, 21.8s Time] [2022-04-28 15:08:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-28 15:08:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1631. [2022-04-28 15:08:13,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:08:13,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 15:08:13,466 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 15:08:13,467 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 15:08:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:08:13,598 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-28 15:08:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-28 15:08:13,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:08:13,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:08:13,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 1899 states. [2022-04-28 15:08:13,606 INFO L87 Difference]: Start difference. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 1899 states. [2022-04-28 15:08:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:08:13,717 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-28 15:08:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-28 15:08:13,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:08:13,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:08:13,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:08:13,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:08:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 15:08:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2392 transitions. [2022-04-28 15:08:13,859 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2392 transitions. Word has length 40 [2022-04-28 15:08:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:08:13,859 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2392 transitions. [2022-04-28 15:08:13,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 15:08:13,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1631 states and 2392 transitions. [2022-04-28 15:08:17,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2392 edges. 2392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:08:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2392 transitions. [2022-04-28 15:08:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 15:08:17,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:08:17,089 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] [2022-04-28 15:08:17,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:08:17,089 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:08:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:08:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 1 times [2022-04-28 15:08:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:08:17,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922395851] [2022-04-28 15:08:17,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:08:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 2 times [2022-04-28 15:08:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:08:17,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486139610] [2022-04-28 15:08:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:08:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:08:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:08:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:17,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {46358#true} is VALID [2022-04-28 15:08:17,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-28 15:08:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:08:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:17,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {46358#true} is VALID [2022-04-28 15:08:17,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-28 15:08:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:08:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:08:17,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {46372#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {46358#true} is VALID [2022-04-28 15:08:17,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-28 15:08:17,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {46358#true} call ULTIMATE.init(); {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:08:17,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {46358#true} is VALID [2022-04-28 15:08:17,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {46358#true} call #t~ret1021 := main(); {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {46358#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 93); {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 68); {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-28 15:08:17,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 904); {46358#true} is VALID [2022-04-28 15:08:17,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {46358#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {46358#true} is VALID [2022-04-28 15:08:17,294 INFO L272 TraceCheckUtils]: 12: Hoare triple {46358#true} call _BLAST_init(); {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:08:17,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {46358#true} is VALID [2022-04-28 15:08:17,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-28 15:08:17,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {46358#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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {46358#true} is VALID [2022-04-28 15:08:17,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {46358#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {46358#true} is VALID [2022-04-28 15:08:17,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {46358#true} call stub_driver_init(); {46372#(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 15:08:17,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {46372#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {46358#true} is VALID [2022-04-28 15:08:17,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 15:08:17,299 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-28 15:08:17,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {46358#true} assume !!(~status~15 >= 0); {46358#true} is VALID [2022-04-28 15:08:17,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {46358#true} assume !(2 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-28 15:08:17,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {46358#true} assume !(3 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-28 15:08:17,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {46358#true} assume 4 == ~__BLAST_NONDET___0~0; {46358#true} is VALID [2022-04-28 15:08:17,305 INFO L272 TraceCheckUtils]: 26: Hoare triple {46358#true} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {46358#true} is VALID [2022-04-28 15:08:17,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {46358#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; {46358#true} is VALID [2022-04-28 15:08:17,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {46358#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,314 INFO L272 TraceCheckUtils]: 30: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {46369#(= ~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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:08:17,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {46359#false} is VALID [2022-04-28 15:08:17,316 INFO L272 TraceCheckUtils]: 38: Hoare triple {46359#false} call errorFn(); {46359#false} is VALID [2022-04-28 15:08:17,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {46359#false} assume !false; {46359#false} is VALID [2022-04-28 15:08:17,317 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 15:08:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:08:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486139610] [2022-04-28 15:08:17,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486139610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:08:17,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:08:17,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:08:17,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:08:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922395851] [2022-04-28 15:08:17,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922395851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:08:17,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:08:17,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:08:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768471536] [2022-04-28 15:08:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:08:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-04-28 15:08:17,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:08:17,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 15:08:17,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:08:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:08:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:08:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:08:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:08:17,344 INFO L87 Difference]: Start difference. First operand 1631 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 15:08:25,606 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 15:08:30,606 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 15:08:40,192 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 15:08:43,624 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 15:08:45,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:08:47,495 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 15:08:49,611 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 15:08:52,380 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 15:08:54,405 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 15:09:04,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:09:06,726 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 15:09:08,748 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 15:09:12,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:09:21,412 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 15:09:23,421 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 15:09:25,443 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 15:09:29,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:09:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:30,269 INFO L93 Difference]: Finished difference Result 1768 states and 2618 transitions. [2022-04-28 15:09:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 15:09:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-04-28 15:09:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:09:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 15:09:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-28 15:09:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 15:09:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-28 15:09:30,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1234 transitions. [2022-04-28 15:09:31,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:09:31,940 INFO L225 Difference]: With dead ends: 1768 [2022-04-28 15:09:31,941 INFO L226 Difference]: Without dead ends: 1764 [2022-04-28 15:09:31,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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 15:09:31,941 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 939 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 360 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:09:31,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1479 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1629 Invalid, 13 Unknown, 0 Unchecked, 39.4s Time] [2022-04-28 15:09:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-28 15:09:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1630. [2022-04-28 15:09:32,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:09:32,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 15:09:32,079 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 15:09:32,080 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 15:09:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:32,183 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-28 15:09:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-28 15:09:32,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:09:32,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:09:32,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 1764 states. [2022-04-28 15:09:32,191 INFO L87 Difference]: Start difference. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 1764 states. [2022-04-28 15:09:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:09:32,300 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-28 15:09:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-28 15:09:32,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:09:32,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:09:32,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:09:32,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:09:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 15:09:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2389 transitions. [2022-04-28 15:09:32,455 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2389 transitions. Word has length 40 [2022-04-28 15:09:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:09:32,455 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2389 transitions. [2022-04-28 15:09:32,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 15:09:32,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1630 states and 2389 transitions. [2022-04-28 15:09:35,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2389 edges. 2389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:09:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2389 transitions. [2022-04-28 15:09:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 15:09:35,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:09:35,772 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, 1, 1, 1] [2022-04-28 15:09:35,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:09:35,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:09:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:09:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 1 times [2022-04-28 15:09:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:09:35,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528158414] [2022-04-28 15:09:35,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:09:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 2 times [2022-04-28 15:09:35,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:09:35,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378796985] [2022-04-28 15:09:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:09:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:09:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:09:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:09:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:09:35,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {56704#true} is VALID [2022-04-28 15:09:35,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:35,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-28 15:09:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:09:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:09:35,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {56704#true} is VALID [2022-04-28 15:09:35,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:35,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-28 15:09:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:09:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:09:36,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {56724#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56704#true} is VALID [2022-04-28 15:09:36,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:36,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-28 15:09:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 15:09:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:09:36,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-28 15:09:36,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-28 15:09:36,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {56704#true} is VALID [2022-04-28 15:09:36,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-28 15:09:36,024 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-28 15:09:36,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {56704#true} call ULTIMATE.init(); {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:09:36,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {56704#true} is VALID [2022-04-28 15:09:36,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:36,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {56704#true} call #t~ret1021 := main(); {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {56704#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 93); {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 68); {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 904); {56704#true} is VALID [2022-04-28 15:09:36,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {56704#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56704#true} is VALID [2022-04-28 15:09:36,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {56704#true} call _BLAST_init(); {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:09:36,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {56704#true} is VALID [2022-04-28 15:09:36,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:36,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-28 15:09:36,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {56704#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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {56704#true} is VALID [2022-04-28 15:09:36,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {56704#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {56704#true} is VALID [2022-04-28 15:09:36,028 INFO L272 TraceCheckUtils]: 18: Hoare triple {56704#true} call stub_driver_init(); {56724#(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 15:09:36,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {56724#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56704#true} is VALID [2022-04-28 15:09:36,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 15:09:36,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-28 15:09:36,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {56704#true} assume !!(~status~15 >= 0); {56704#true} is VALID [2022-04-28 15:09:36,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {56704#true} assume !(2 == ~__BLAST_NONDET___0~0); {56704#true} is VALID [2022-04-28 15:09:36,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {56704#true} assume 3 == ~__BLAST_NONDET___0~0; {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L272 TraceCheckUtils]: 25: Hoare triple {56704#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {56704#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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {56704#true} assume 0 == #t~mem130 % 256;havoc #t~mem130; {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L272 TraceCheckUtils]: 28: Hoare triple {56704#true} call #t~ret132 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {56704#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(57);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(8);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(8);call #t~mem64.base, #t~mem64.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset; {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L272 TraceCheckUtils]: 30: Hoare triple {56704#true} call #t~ret65 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-28 15:09:36,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {56704#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(28);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~mem945.base, #t~mem945.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem945.base, #t~mem945.offset;havoc #t~mem945.base, #t~mem945.offset;call #t~mem946.base, #t~mem946.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~2.base, ~irpSp~2.offset := #t~mem946.base, #t~mem946.offset;havoc #t~mem946.base, #t~mem946.offset;call #t~mem947.base, #t~mem947.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem947.base, #t~mem947.offset - 68;havoc #t~mem947.base, #t~mem947.offset; {56704#true} is VALID [2022-04-28 15:09:36,031 INFO L272 TraceCheckUtils]: 32: Hoare triple {56704#true} call #t~memcpy~res948.base, #t~memcpy~res948.offset := #Ultimate.C_memcpy(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 52); {56725#(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 15:09:36,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-28 15:09:36,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {56704#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-28 15:09:36,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {56704#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {56704#true} is VALID [2022-04-28 15:09:36,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-28 15:09:36,031 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-28 15:09:36,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {56704#true} havoc #t~memcpy~res948.base, #t~memcpy~res948.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56704#true} is VALID [2022-04-28 15:09:36,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {56704#true} assume !(~s~0 != ~NP~0); {56704#true} is VALID [2022-04-28 15:09:36,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {56704#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 15:09:36,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem949.base, #t~mem949.offset - 68;havoc #t~mem949.base, #t~mem949.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 52 + ~irpSp___0~1.offset, 8);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 60 + ~irpSp___0~1.offset, 8);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~mem950 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem950 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem950;call #t~mem951 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem951 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem951;call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 8); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 15:09:36,034 INFO L272 TraceCheckUtils]: 42: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~ret953 := IofCallDriver(#t~mem952.base, #t~mem952.offset, ~Irp.base, ~Irp.offset); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 15:09:36,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {56720#(= ~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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56721#(not (= ~routine~0 0))} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {56721#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L272 TraceCheckUtils]: 46: Hoare triple {56705#false} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {56705#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; {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {56705#false} assume 0 != ~myIrp_PendingReturned~0; {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {56705#false} assume !(0 == ~pended~0); {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L272 TraceCheckUtils]: 50: Hoare triple {56705#false} call errorFn(); {56705#false} is VALID [2022-04-28 15:09:36,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {56705#false} assume !false; {56705#false} is VALID [2022-04-28 15:09:36,037 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 15:09:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:09:36,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378796985] [2022-04-28 15:09:36,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378796985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:09:36,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:09:36,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 15:09:36,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:09:36,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528158414] [2022-04-28 15:09:36,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528158414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:09:36,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:09:36,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 15:09:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659126883] [2022-04-28 15:09:36,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:09:36,038 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, (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 52 [2022-04-28 15:09:36,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:09:36,039 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, (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 15:09:36,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:09:36,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 15:09:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:09:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 15:09:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 15:09:36,081 INFO L87 Difference]: Start difference. First operand 1630 states and 2389 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, (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 15:10:02,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:10:04,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 15:10:15,212 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 15:10:17,591 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 15:10:21,629 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 15:10:24,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:10:26,819 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 15:10:31,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:10:32,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:10:39,106 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 15:10:43,261 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 15:10:47,199 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 15:10:50,474 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 15:10:58,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:11:00,291 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 15:11:02,321 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 15:11:07,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 15:11:14,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 15:11:16,322 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 15:11:19,013 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 15:11:21,947 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 15:11:27,526 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 15:11:30,100 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 15:11:33,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:11:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:11:34,089 INFO L93 Difference]: Finished difference Result 2734 states and 4044 transitions. [2022-04-28 15:11:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 15:11:34,089 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, (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 52 [2022-04-28 15:11:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:11:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (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 15:11:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-28 15:11:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (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 15:11:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-28 15:11:34,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 2103 transitions. [2022-04-28 15:11:36,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:11:36,687 INFO L225 Difference]: With dead ends: 2734 [2022-04-28 15:11:36,688 INFO L226 Difference]: Without dead ends: 1596 [2022-04-28 15:11:36,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-28 15:11:36,691 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 2060 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 1015 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:11:36,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1659 Invalid, 4276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3247 Invalid, 14 Unknown, 0 Unchecked, 62.4s Time] [2022-04-28 15:11:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-28 15:11:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1203. [2022-04-28 15:11:36,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:11:36,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 15:11:36,832 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 15:11:36,833 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 15:11:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:11:36,917 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-28 15:11:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-28 15:11:36,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:11:36,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:11:36,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 1596 states. [2022-04-28 15:11:36,923 INFO L87 Difference]: Start difference. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 1596 states. [2022-04-28 15:11:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:11:37,007 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-28 15:11:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-28 15:11:37,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:11:37,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:11:37,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:11:37,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:11:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 15:11:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1742 transitions. [2022-04-28 15:11:37,098 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1742 transitions. Word has length 52 [2022-04-28 15:11:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:11:37,098 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1742 transitions. [2022-04-28 15:11:37,098 INFO L496 AbstractCegarLoop]: INTERPOLANT 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, (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 15:11:37,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1203 states and 1742 transitions. [2022-04-28 15:11:40,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1742 edges. 1742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:11:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1742 transitions. [2022-04-28 15:11:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 15:11:40,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:11:40,083 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, 1, 1, 1, 1] [2022-04-28 15:11:40,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:11:40,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:11:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:11:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 1 times [2022-04-28 15:11:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:11:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640040632] [2022-04-28 15:11:40,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:11:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 2 times [2022-04-28 15:11:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:11:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101266062] [2022-04-28 15:11:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:11:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:11:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:11:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:11:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:11:40,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:11:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:11:40,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {67819#true} is VALID [2022-04-28 15:11:40,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 15:11:40,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:11:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:11:40,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {67838#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67819#true} is VALID [2022-04-28 15:11:40,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 15:11:40,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 15:11:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:11:40,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-28 15:11:40,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-28 15:11:40,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {67819#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {67819#true} is VALID [2022-04-28 15:11:40,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-28 15:11:40,312 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {67819#true} call ULTIMATE.init(); {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:11:40,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1021 := main(); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {67824#(= ~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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 93); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 68); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 904); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:11:40,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {67819#true} is VALID [2022-04-28 15:11:40,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 15:11:40,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {67824#(= ~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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,319 INFO L272 TraceCheckUtils]: 18: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67838#(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 15:11:40,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {67838#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67819#true} is VALID [2022-04-28 15:11:40,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 15:11:40,319 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,321 INFO L272 TraceCheckUtils]: 24: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret978 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {67824#(= ~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~mem159.base, #t~mem159.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem159.base, #t~mem159.offset;havoc #t~mem159.base, #t~mem159.offset;call #t~mem160 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem160 % 256);havoc #t~mem160;call #t~mem161 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem161 % 256);havoc #t~mem161;call #t~mem162 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem162 % 256);havoc #t~mem162;call #t~mem163 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem163 % 256;havoc #t~mem163; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,326 INFO L272 TraceCheckUtils]: 30: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret167 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {67824#(= ~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~mem932.base, #t~mem932.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem932.base, #t~mem932.offset;havoc #t~mem932.base, #t~mem932.offset;call #t~mem933.base, #t~mem933.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem933.base, #t~mem933.offset - 68;havoc #t~mem933.base, #t~mem933.offset;call #t~mem934.base, #t~mem934.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem934.base, #t~mem934.offset;havoc #t~mem934.base, #t~mem934.offset;call #t~mem935 := read~int(~currentIrpStack~7.base, 20 + ~currentIrpStack~7.offset, 8); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume #t~mem935 % 18446744073709551616 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 18446744073709551616;havoc #t~mem935;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~1.base, ~irpSp~1.offset := #t~mem936.base, #t~mem936.offset;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem937.base, #t~mem937.offset - 68;havoc #t~mem937.base, #t~mem937.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,328 INFO L272 TraceCheckUtils]: 33: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~memcpy~res938.base, #t~memcpy~res938.offset := #Ultimate.C_memcpy(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 52); {67839#(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 15:11:40,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-28 15:11:40,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {67819#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-28 15:11:40,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {67819#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {67819#true} is VALID [2022-04-28 15:11:40,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-28 15:11:40,329 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc #t~memcpy~res938.base, #t~memcpy~res938.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {67824#(= ~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem939.base, #t~mem939.offset - 68;havoc #t~mem939.base, #t~mem939.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 52 + ~irpSp___0~0.offset, 8);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 60 + ~irpSp___0~0.offset, 8);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~mem940 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem940 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem940;call #t~mem941 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem941 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem941;call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 8); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,331 INFO L272 TraceCheckUtils]: 43: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret943 := IofCallDriver(#t~mem942.base, #t~mem942.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {67824#(= ~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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,332 INFO L272 TraceCheckUtils]: 47: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {67824#(= ~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 15:11:40,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67820#false} is VALID [2022-04-28 15:11:40,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {67820#false} assume !(0 == ~pended~0); {67820#false} is VALID [2022-04-28 15:11:40,333 INFO L272 TraceCheckUtils]: 51: Hoare triple {67820#false} call errorFn(); {67820#false} is VALID [2022-04-28 15:11:40,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {67820#false} assume !false; {67820#false} is VALID [2022-04-28 15:11:40,333 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 15:11:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:11:40,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101266062] [2022-04-28 15:11:40,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101266062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:11:40,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:11:40,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:11:40,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:11:40,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640040632] [2022-04-28 15:11:40,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640040632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:11:40,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:11:40,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:11:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258676695] [2022-04-28 15:11:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:11:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 53 [2022-04-28 15:11:40,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:11:40,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 15:11:40,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:11:40,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:11:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:11:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:11:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:11:40,382 INFO L87 Difference]: Start difference. First operand 1203 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 15:11:57,672 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 15:12:01,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:12:05,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:12:08,169 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 15:12:13,498 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 15:12:20,736 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 15:12:23,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:12:28,798 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 15:12:34,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:12:38,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:12:40,436 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 15:12:43,857 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 15:12:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:44,629 INFO L93 Difference]: Finished difference Result 2154 states and 3211 transitions. [2022-04-28 15:12:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:12:44,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 53 [2022-04-28 15:12:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:12:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 15:12:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-28 15:12:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 15:12:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-28 15:12:44,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1904 transitions. [2022-04-28 15:12:47,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1904 edges. 1904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:12:47,106 INFO L225 Difference]: With dead ends: 2154 [2022-04-28 15:12:47,106 INFO L226 Difference]: Without dead ends: 1486 [2022-04-28 15:12:47,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-28 15:12:47,108 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 1797 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 741 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:12:47,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1170 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 1771 Invalid, 7 Unknown, 0 Unchecked, 30.9s Time] [2022-04-28 15:12:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-04-28 15:12:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1200. [2022-04-28 15:12:47,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:12:47,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 15:12:47,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 15:12:47,301 INFO L87 Difference]: Start difference. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 15:12:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:47,372 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-28 15:12:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-28 15:12:47,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:12:47,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:12:47,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 1486 states. [2022-04-28 15:12:47,378 INFO L87 Difference]: Start difference. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 1486 states. [2022-04-28 15:12:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:47,448 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-28 15:12:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-28 15:12:47,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:12:47,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:12:47,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:12:47,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:12:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 15:12:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1731 transitions. [2022-04-28 15:12:47,524 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1731 transitions. Word has length 53 [2022-04-28 15:12:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:12:47,525 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1731 transitions. [2022-04-28 15:12:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 15:12:47,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1200 states and 1731 transitions. [2022-04-28 15:12:50,633 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 15:12:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1731 transitions. [2022-04-28 15:12:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 15:12:50,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:12:50,634 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, 1, 1, 1, 1] [2022-04-28 15:12:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:12:50,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:12:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:12:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 1 times [2022-04-28 15:12:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:50,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92902979] [2022-04-28 15:12:50,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:12:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 2 times [2022-04-28 15:12:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:12:50,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730705969] [2022-04-28 15:12:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:12:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:12:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:12:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {77535#true} is VALID [2022-04-28 15:12:50,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 15:12:50,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-28 15:12:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:12:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:12:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {77564#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {77535#true} is VALID [2022-04-28 15:12:50,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 15:12:50,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 15:12:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 15:12:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:50,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,913 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(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; {77535#true} is VALID [2022-04-28 15:12:50,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:12:50,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:12:50,916 INFO L272 TraceCheckUtils]: 3: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(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 15:12:50,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,919 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,920 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-28 15:12:50,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {77535#true} call ULTIMATE.init(); {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:12:50,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {77535#true} call #t~ret1021 := main(); {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {77535#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 93); {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 68); {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 904); {77535#true} is VALID [2022-04-28 15:12:50,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {77535#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {77535#true} is VALID [2022-04-28 15:12:50,925 INFO L272 TraceCheckUtils]: 12: Hoare triple {77535#true} call _BLAST_init(); {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:12:50,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,926 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {77543#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,928 INFO L272 TraceCheckUtils]: 18: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {77564#(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 15:12:50,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {77564#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {77535#true} is VALID [2022-04-28 15:12:50,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 15:12:50,928 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 15:12:50,930 INFO L272 TraceCheckUtils]: 26: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {77565#(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 15:12:50,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {77565#(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; {77535#true} is VALID [2022-04-28 15:12:50,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:12:50,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 15:12:50,933 INFO L272 TraceCheckUtils]: 30: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(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 15:12:50,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 15:12:50,936 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 15:12:50,938 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {77536#false} assume -9223372036854775808 <= #t~ret980 && #t~ret980 <= 9223372036854775807;~status~15 := #t~ret980;havoc #t~ret980; {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {77536#false} assume 0 != ~we_should_unload~0; {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {77536#false} assume !(~s~0 == ~UNLOADED~0); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {77536#false} assume !(-1 == ~status~15); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {77536#false} assume !(~s~0 != ~SKIP2~0); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {77536#false} assume ~s~0 == ~DC~0; {77536#false} is VALID [2022-04-28 15:12:50,938 INFO L272 TraceCheckUtils]: 51: Hoare triple {77536#false} call errorFn(); {77536#false} is VALID [2022-04-28 15:12:50,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {77536#false} assume !false; {77536#false} is VALID [2022-04-28 15:12:50,939 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 15:12:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:12:50,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730705969] [2022-04-28 15:12:50,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730705969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:50,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:50,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 15:12:50,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:12:50,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92902979] [2022-04-28 15:12:50,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92902979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:50,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:50,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 15:12:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759762549] [2022-04-28 15:12:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:12:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 53 [2022-04-28 15:12:50,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:12:50,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 15:12:50,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:12:50,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 15:12:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 15:12:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 15:12:50,981 INFO L87 Difference]: Start difference. First operand 1200 states and 1731 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 15:13:14,122 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 15:13:28,435 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 15:13:30,472 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 15:13:34,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:13:36,418 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 15:13:46,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 15:13:48,874 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 15:13:51,082 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 15:13:54,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:13:56,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:13:58,235 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 15:14:04,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:14:07,764 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 15:14:15,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:14:21,623 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 15:14:37,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:14:39,739 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 15:14:41,767 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 15:14:54,743 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 15:14:56,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:15:01,223 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 15:15:03,365 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 15:15:05,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:15:09,269 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 15:15:12,060 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 15:15:17,584 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 15:15:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:20,039 INFO L93 Difference]: Finished difference Result 1832 states and 2719 transitions. [2022-04-28 15:15:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 15:15:20,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 53 [2022-04-28 15:15:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 15:15:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-28 15:15:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 15:15:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-28 15:15:20,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 1922 transitions. [2022-04-28 15:15:22,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1922 edges. 1922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:22,766 INFO L225 Difference]: With dead ends: 1832 [2022-04-28 15:15:22,766 INFO L226 Difference]: Without dead ends: 1772 [2022-04-28 15:15:22,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-04-28 15:15:22,768 INFO L413 NwaCegarLoop]: 1062 mSDtfsCounter, 2903 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 1366 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1366 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:22,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2936 Valid, 2828 Invalid, 5821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1366 Valid, 4437 Invalid, 18 Unknown, 0 Unchecked, 68.2s Time] [2022-04-28 15:15:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-04-28 15:15:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1272. [2022-04-28 15:15:22,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:22,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 15:15:22,961 INFO L74 IsIncluded]: Start isIncluded. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 15:15:22,962 INFO L87 Difference]: Start difference. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 15:15:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:23,059 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-28 15:15:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-28 15:15:23,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:23,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:23,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 1772 states. [2022-04-28 15:15:23,066 INFO L87 Difference]: Start difference. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 1772 states. [2022-04-28 15:15:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:23,171 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-28 15:15:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-28 15:15:23,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:23,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:23,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:23,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 15:15:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1819 transitions. [2022-04-28 15:15:23,254 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1819 transitions. Word has length 53 [2022-04-28 15:15:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:23,254 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1819 transitions. [2022-04-28 15:15:23,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 15:15:23,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1272 states and 1819 transitions. [2022-04-28 15:15:26,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1819 transitions. [2022-04-28 15:15:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 15:15:26,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:26,750 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, 1, 1, 1, 1, 1, 1] [2022-04-28 15:15:26,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:15:26,750 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 1 times [2022-04-28 15:15:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:26,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179379223] [2022-04-28 15:15:26,751 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:15:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 2 times [2022-04-28 15:15:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:26,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679468278] [2022-04-28 15:15:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {87367#true} is VALID [2022-04-28 15:15:26,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 15:15:26,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-28 15:15:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 15:15:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:26,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:26,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 15:15:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {87401#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {87367#true} is VALID [2022-04-28 15:15:26,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 15:15:26,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 15:15:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 15:15:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 15:15:27,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 15:15:27,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,063 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(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; {87367#true} is VALID [2022-04-28 15:15:27,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-28 15:15:27,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L272 TraceCheckUtils]: 3: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(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 15:15:27,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 15:15:27,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 15:15:27,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,066 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,067 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {87367#true} call ULTIMATE.init(); {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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 15:15:27,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~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; {87367#true} is VALID [2022-04-28 15:15:27,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 15:15:27,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-28 15:15:27,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {87367#true} call #t~ret1021 := main(); {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#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 -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 93); {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 68); {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 904); {87367#true} is VALID [2022-04-28 15:15:27,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {87367#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {87367#true} is VALID [2022-04-28 15:15:27,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {87367#true} call _BLAST_init(); {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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 15:15:27,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~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; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} 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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,072 INFO L272 TraceCheckUtils]: 18: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} call stub_driver_init(); {87401#(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 15:15:27,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {87401#(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 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {87367#true} is VALID [2022-04-28 15:15:27,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 15:15:27,073 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !!(~status~15 >= 0); {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 15:15:27,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !(2 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-28 15:15:27,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume !(3 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-28 15:15:27,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume 4 == ~__BLAST_NONDET___0~0; {87380#(not (= ~SKIP2~0 ~DC~0))} is VALID [2022-04-28 15:15:27,075 INFO L272 TraceCheckUtils]: 26: Hoare triple {87380#(not (= ~SKIP2~0 ~DC~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87402#(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 15:15:27,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {87402#(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; {87367#true} is VALID [2022-04-28 15:15:27,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-28 15:15:27,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L272 TraceCheckUtils]: 30: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(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 15:15:27,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 15:15:27,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 15:15:27,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,078 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 15:15:27,079 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume -9223372036854775808 <= #t~ret980 && #t~ret980 <= 9223372036854775807;~status~15 := #t~ret980;havoc #t~ret980; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~15); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~SKIP2~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 15:15:27,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume ~s~0 == ~DC~0; {87368#false} is VALID [2022-04-28 15:15:27,081 INFO L272 TraceCheckUtils]: 53: Hoare triple {87368#false} call errorFn(); {87368#false} is VALID [2022-04-28 15:15:27,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {87368#false} assume !false; {87368#false} is VALID [2022-04-28 15:15:27,081 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 15:15:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679468278] [2022-04-28 15:15:27,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679468278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:27,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:27,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 15:15:27,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179379223] [2022-04-28 15:15:27,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179379223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:27,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:27,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 15:15:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097529125] [2022-04-28 15:15:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-04-28 15:15:27,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:27,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 15:15:27,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:27,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 15:15:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:27,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 15:15:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 15:15:27,131 INFO L87 Difference]: Start difference. First operand 1272 states and 1819 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)