/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:24:28,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:24:28,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:24:28,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:24:28,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:24:28,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:24:28,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:24:28,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:24:28,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:24:28,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:24:28,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:24:28,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:24:28,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:24:28,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:24:28,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:24:28,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:24:28,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:24:28,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:24:28,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:24:28,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:24:28,729 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:24:28,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:24:28,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:24:28,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:24:28,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:24:28,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:24:28,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:24:28,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:24:28,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:24:28,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:24:28,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:24:28,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:24:28,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:24:28,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:24:28,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:24:28,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:24:28,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:24:28,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:24:28,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:24:28,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:24:28,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:24:28,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:24:28,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:24:28,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:24:28,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:24:28,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:24:28,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:24:28,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:24:28,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:24:28,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:24:28,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:24:28,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:24:28,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:24:28,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:24:28,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:24:28,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:24:28,768 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:24:28,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:24:28,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:24:28,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:24:28,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:24:28,991 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:24:28,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-15 11:24:29,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbeb1aea/730183c5346642c2be67a1cae4e104e3/FLAGc880a7d88 [2022-04-15 11:24:29,634 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:24:29,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-15 11:24:29,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbeb1aea/730183c5346642c2be67a1cae4e104e3/FLAGc880a7d88 [2022-04-15 11:24:30,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fbeb1aea/730183c5346642c2be67a1cae4e104e3 [2022-04-15 11:24:30,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:24:30,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:24:30,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:24:30,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:24:30,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:24:30,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:24:30" (1/1) ... [2022-04-15 11:24:30,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bb0019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:30, skipping insertion in model container [2022-04-15 11:24:30,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:24:30" (1/1) ... [2022-04-15 11:24:30,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:24:30,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:24:30,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-04-15 11:24:31,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:24:31,147 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:24:31,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-04-15 11:24:31,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:24:31,469 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:24:31,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31 WrapperNode [2022-04-15 11:24:31,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:24:31,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:24:31,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:24:31,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:24:31,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:24:31,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:24:31,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:24:31,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:24:31,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (1/1) ... [2022-04-15 11:24:31,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:24:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:24:31,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:24:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-15 11:24:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-15 11:24:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 11:24:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 11:24:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-15 11:24:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-15 11:24:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-15 11:24:31,842 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:24:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-15 11:24:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-15 11:24:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:24:31,846 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-15 11:24:31,847 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-15 11:24:31,847 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-15 11:24:31,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-15 11:24:31,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-15 11:24:31,847 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-15 11:24:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-15 11:24:31,849 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-15 11:24:31,849 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:24:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:24:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:24:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-15 11:24:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-15 11:24:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-15 11:24:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-15 11:24:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-15 11:24:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-15 11:24:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-15 11:24:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-15 11:24:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-15 11:24:31,853 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-15 11:24:31,854 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-15 11:24:31,854 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-15 11:24:31,854 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-15 11:24:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-15 11:24:31,855 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:24:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-15 11:24:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:24:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-15 11:24:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-15 11:24:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-15 11:24:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-15 11:24:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-15 11:24:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-15 11:24:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-15 11:24:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 11:24:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:24:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:24:32,384 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:24:32,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:24:32,422 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:32,448 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:32,448 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:32,449 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:32,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:32,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:32,463 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:32,470 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:32,471 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:32,471 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:32,498 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:32,498 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:32,500 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:34,849 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 11:24:34,849 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 11:24:34,867 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:34,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:34,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:34,876 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:34,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:34,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:34,885 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:34,898 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:34,898 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:34,899 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:34,920 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:34,920 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:34,925 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,527 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:24:38,527 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:24:38,531 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-15 11:24:38,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-15 11:24:38,678 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,683 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:38,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:38,684 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,710 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 11:24:38,710 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 11:24:38,711 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,715 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:38,715 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:38,716 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,725 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:38,726 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:38,752 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:38,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:38,757 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:38,763 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:38,763 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:39,162 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:41,991 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:24:41,992 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:24:41,999 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:43,999 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-15 11:24:44,000 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-15 11:24:44,009 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:44,027 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-15 11:24:44,028 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-15 11:24:44,048 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:44,052 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:44,052 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:44,091 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:44,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-15 11:24:44,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-15 11:24:44,242 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:44,247 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:44,247 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:44,304 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:44,308 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:44,308 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:44,308 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,270 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 11:24:49,270 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 11:24:49,275 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-15 11:24:49,296 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-15 11:24:49,304 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,314 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 11:24:49,314 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 11:24:49,385 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,390 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:49,390 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:49,925 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,972 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-15 11:24:49,972 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-15 11:24:49,972 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-15 11:24:49,972 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:49,978 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:24:49,978 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:24:50,041 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:24:56,567 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:24:56,568 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:24:56,647 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:24:56,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:24:56,676 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-04-15 11:24:56,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:24:56 BoogieIcfgContainer [2022-04-15 11:24:56,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:24:56,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:24:56,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:24:56,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:24:56,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:24:30" (1/3) ... [2022-04-15 11:24:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddb8722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:24:56, skipping insertion in model container [2022-04-15 11:24:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:24:31" (2/3) ... [2022-04-15 11:24:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddb8722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:24:56, skipping insertion in model container [2022-04-15 11:24:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:24:56" (3/3) ... [2022-04-15 11:24:56,695 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-04-15 11:24:56,715 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:24:56,715 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:24:56,788 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:24:56,798 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:24:56,798 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:24:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-15 11:24:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:24:56,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:24:56,848 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:24:56,848 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:24:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:24:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 1 times [2022-04-15 11:24:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:56,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1536166851] [2022-04-15 11:24:56,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:24:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 2 times [2022-04-15 11:24:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:24:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974269285] [2022-04-15 11:24:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:24:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:24:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:57,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:24:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:57,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-15 11:24:57,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-15 11:24:57,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-15 11:24:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:24:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:57,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1256#true} call ULTIMATE.init(); {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:24:57,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-15 11:24:57,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-15 11:24:57,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-15 11:24:57,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1256#true} call #t~ret1013 := main(); {1256#true} is VALID [2022-04-15 11:24:57,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1256#true} is VALID [2022-04-15 11:24:57,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {1256#true} call _BLAST_init(); {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:24:57,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,519 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:24:57,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1257#false} is VALID [2022-04-15 11:24:57,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#false} assume !(-1 == ~status~15); {1257#false} is VALID [2022-04-15 11:24:57,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#false} assume !(~s~0 != ~SKIP2~0); {1257#false} is VALID [2022-04-15 11:24:57,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#false} assume 1 == ~pended~0; {1257#false} is VALID [2022-04-15 11:24:57,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#false} assume 259 != ~status~15; {1257#false} is VALID [2022-04-15 11:24:57,521 INFO L272 TraceCheckUtils]: 18: Hoare triple {1257#false} call errorFn(); {1257#false} is VALID [2022-04-15 11:24:57,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-04-15 11:24:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:24:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:24:57,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974269285] [2022-04-15 11:24:57,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974269285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:57,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:57,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:24:57,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:24:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1536166851] [2022-04-15 11:24:57,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1536166851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:57,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:57,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:24:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690223183] [2022-04-15 11:24:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:24:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-15 11:24:57,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:24:57,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:24:57,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:57,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:24:57,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:24:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:24:57,595 INFO L87 Difference]: Start difference. First operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:25:12,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:19,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:32,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:35,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:37,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:42,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:44,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:47,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:54,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:57,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:58,108 INFO L93 Difference]: Finished difference Result 1365 states and 2147 transitions. [2022-04-15 11:25:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:25:58,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-15 11:25:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:25:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:25:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-15 11:25:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:25:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-15 11:25:58,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2147 transitions. [2022-04-15 11:26:00,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:00,783 INFO L225 Difference]: With dead ends: 1365 [2022-04-15 11:26:00,783 INFO L226 Difference]: Without dead ends: 834 [2022-04-15 11:26:00,790 INFO L912 BasicCegarLoop]: 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-15 11:26:00,796 INFO L913 BasicCegarLoop]: 920 mSDtfsCounter, 460 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 187 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:26:00,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1298 Invalid, 2168 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [187 Valid, 1974 Invalid, 7 Unknown, 0 Unchecked, 26.9s Time] [2022-04-15 11:26:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-15 11:26:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 671. [2022-04-15 11:26:00,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:26:00,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 11:26:00,948 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 11:26:00,949 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 11:26:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:01,001 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-15 11:26:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-15 11:26:01,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:01,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:01,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-15 11:26:01,014 INFO L87 Difference]: Start difference. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-15 11:26:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:01,049 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-15 11:26:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-15 11:26:01,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:01,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:01,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:26:01,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:26:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 11:26:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 980 transitions. [2022-04-15 11:26:01,083 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 980 transitions. Word has length 20 [2022-04-15 11:26:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:26:01,085 INFO L478 AbstractCegarLoop]: Abstraction has 671 states and 980 transitions. [2022-04-15 11:26:01,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:26:01,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 671 states and 980 transitions. [2022-04-15 11:26:01,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 980 edges. 980 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 980 transitions. [2022-04-15 11:26:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:26:01,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:26:01,925 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:26:01,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:26:01,926 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:26:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:26:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 1 times [2022-04-15 11:26:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:01,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043001454] [2022-04-15 11:26:01,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:26:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 2 times [2022-04-15 11:26:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:26:01,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118802129] [2022-04-15 11:26:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:26:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:26:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:26:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:02,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-15 11:26:02,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 11:26:02,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-15 11:26:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:26:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:02,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-15 11:26:02,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 11:26:02,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-15 11:26:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:26:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:02,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {7014#true} call ULTIMATE.init(); {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:26:02,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-15 11:26:02,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 11:26:02,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-15 11:26:02,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {7014#true} call #t~ret1013 := main(); {7014#true} is VALID [2022-04-15 11:26:02,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {7014#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7014#true} is VALID [2022-04-15 11:26:02,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {7014#true} call _BLAST_init(); {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:26:02,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-15 11:26:02,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 11:26:02,153 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-15 11:26:02,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {7014#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {7014#true} is VALID [2022-04-15 11:26:02,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {7014#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {7014#true} is VALID [2022-04-15 11:26:02,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {7014#true} call stub_driver_init(); {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:26:02,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,155 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {7025#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,157 INFO L272 TraceCheckUtils]: 20: Hoare triple {7025#(= ~s~0 ~NP~0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {7025#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:02,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7015#false} is VALID [2022-04-15 11:26:02,158 INFO L272 TraceCheckUtils]: 23: Hoare triple {7015#false} call errorFn(); {7015#false} is VALID [2022-04-15 11:26:02,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {7015#false} assume !false; {7015#false} is VALID [2022-04-15 11:26:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:26:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:26:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118802129] [2022-04-15 11:26:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118802129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:02,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:02,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:26:02,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:26:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043001454] [2022-04-15 11:26:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043001454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:02,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:26:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464729664] [2022-04-15 11:26:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:26:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 11:26:02,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:26:02,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:26:02,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:02,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:26:02,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:02,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:26:02,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:26:02,182 INFO L87 Difference]: Start difference. First operand 671 states and 980 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:26:19,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:21,360 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-15 11:26:34,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:36,231 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-15 11:26:41,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:45,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:53,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:55,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:57,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:58,052 INFO L93 Difference]: Finished difference Result 1451 states and 2142 transitions. [2022-04-15 11:26:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:26:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 11:26:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:26:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:26:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-15 11:26:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:26:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-15 11:26:58,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2142 transitions. [2022-04-15 11:27:00,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2142 edges. 2142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:00,603 INFO L225 Difference]: With dead ends: 1451 [2022-04-15 11:27:00,604 INFO L226 Difference]: Without dead ends: 1173 [2022-04-15 11:27:00,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:27:00,605 INFO L913 BasicCegarLoop]: 1225 mSDtfsCounter, 1922 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 565 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:27:00,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1960 Valid, 1967 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1809 Invalid, 7 Unknown, 0 Unchecked, 25.5s Time] [2022-04-15 11:27:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-04-15 11:27:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 983. [2022-04-15 11:27:00,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:27:00,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 11:27:00,705 INFO L74 IsIncluded]: Start isIncluded. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 11:27:00,707 INFO L87 Difference]: Start difference. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 11:27:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:00,755 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-15 11:27:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-15 11:27:00,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:00,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:00,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-15 11:27:00,762 INFO L87 Difference]: Start difference. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-15 11:27:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:00,811 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-15 11:27:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-15 11:27:00,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:00,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:00,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:27:00,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:27:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 11:27:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1437 transitions. [2022-04-15 11:27:00,866 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1437 transitions. Word has length 25 [2022-04-15 11:27:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:27:00,867 INFO L478 AbstractCegarLoop]: Abstraction has 983 states and 1437 transitions. [2022-04-15 11:27:00,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:27:00,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 983 states and 1437 transitions. [2022-04-15 11:27:02,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1437 transitions. [2022-04-15 11:27:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:27:02,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:02,352 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:27:02,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:27:02,352 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 1 times [2022-04-15 11:27:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099965002] [2022-04-15 11:27:02,353 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 2 times [2022-04-15 11:27:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191064874] [2022-04-15 11:27:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:02,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:02,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-15 11:27:02,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-15 11:27:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:27:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:02,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-15 11:27:02,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-15 11:27:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:27:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:02,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {14251#true} is VALID [2022-04-15 11:27:02,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-15 11:27:02,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {14251#true} call ULTIMATE.init(); {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:27:02,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-15 11:27:02,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-15 11:27:02,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {14251#true} call #t~ret1013 := main(); {14251#true} is VALID [2022-04-15 11:27:02,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {14251#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14251#true} is VALID [2022-04-15 11:27:02,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {14251#true} call _BLAST_init(); {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:02,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-15 11:27:02,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,581 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-15 11:27:02,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {14251#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {14251#true} is VALID [2022-04-15 11:27:02,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {14251#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {14251#true} is VALID [2022-04-15 11:27:02,583 INFO L272 TraceCheckUtils]: 12: Hoare triple {14251#true} call stub_driver_init(); {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:27:02,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {14251#true} is VALID [2022-04-15 11:27:02,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {14251#true} assume !!(~status~15 >= 0); {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {14251#true} assume !(2 == ~__BLAST_NONDET___0~0); {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {14251#true} assume 3 == ~__BLAST_NONDET___0~0; {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L272 TraceCheckUtils]: 19: Hoare triple {14251#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {14251#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {14251#true} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-15 11:27:02,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {14251#true} assume 22 == #t~mem134 % 256;havoc #t~mem134; {14251#true} is VALID [2022-04-15 11:27:02,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {14251#true} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14251#true} is VALID [2022-04-15 11:27:02,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {14251#true} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {14251#true} is VALID [2022-04-15 11:27:02,585 INFO L272 TraceCheckUtils]: 25: Hoare triple {14251#true} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14251#true} is VALID [2022-04-15 11:27:02,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {14251#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {14251#true} is VALID [2022-04-15 11:27:02,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {14251#true} assume !(~s~0 == ~MPR3~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:27:02,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:27:02,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14252#false} is VALID [2022-04-15 11:27:02,587 INFO L272 TraceCheckUtils]: 30: Hoare triple {14252#false} call errorFn(); {14252#false} is VALID [2022-04-15 11:27:02,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {14252#false} assume !false; {14252#false} is VALID [2022-04-15 11:27:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:02,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191064874] [2022-04-15 11:27:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191064874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:27:02,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099965002] [2022-04-15 11:27:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099965002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:02,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:27:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671117629] [2022-04-15 11:27:02,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-15 11:27:02,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:02,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:27:02,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:02,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:27:02,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:27:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:27:02,616 INFO L87 Difference]: Start difference. First operand 983 states and 1437 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:27:06,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:14,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:18,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:24,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:31,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:37,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:44,609 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-15 11:27:46,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:53,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:56,104 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-15 11:27:58,858 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-15 11:28:01,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:08,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:11,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-15 11:28:14,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:16,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:18,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:23,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:25,823 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-15 11:28:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:27,937 INFO L93 Difference]: Finished difference Result 2287 states and 3438 transitions. [2022-04-15 11:28:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:28:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-15 11:28:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:28:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-15 11:28:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:28:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-15 11:28:27,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2358 transitions. [2022-04-15 11:28:30,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2358 edges. 2358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:30,463 INFO L225 Difference]: With dead ends: 2287 [2022-04-15 11:28:30,463 INFO L226 Difference]: Without dead ends: 1830 [2022-04-15 11:28:30,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:28:30,467 INFO L913 BasicCegarLoop]: 1374 mSDtfsCounter, 1547 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 516 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:30,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 2171 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2312 Invalid, 12 Unknown, 0 Unchecked, 44.0s Time] [2022-04-15 11:28:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-04-15 11:28:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1164. [2022-04-15 11:28:30,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:30,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 11:28:30,562 INFO L74 IsIncluded]: Start isIncluded. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 11:28:30,565 INFO L87 Difference]: Start difference. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 11:28:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:30,670 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-15 11:28:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-15 11:28:30,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:30,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:30,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-15 11:28:30,678 INFO L87 Difference]: Start difference. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-15 11:28:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:30,786 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-15 11:28:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-15 11:28:30,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:30,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:30,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:30,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 11:28:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1722 transitions. [2022-04-15 11:28:30,870 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1722 transitions. Word has length 32 [2022-04-15 11:28:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:30,870 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1722 transitions. [2022-04-15 11:28:30,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:28:30,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1722 transitions. [2022-04-15 11:28:32,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1722 transitions. [2022-04-15 11:28:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:28:32,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:28:32,779 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:28:32,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:28:32,781 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:28:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:28:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 1 times [2022-04-15 11:28:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:32,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515962696] [2022-04-15 11:28:32,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:28:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 2 times [2022-04-15 11:28:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:28:32,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377364924] [2022-04-15 11:28:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:28:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:28:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:28:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:32,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-15 11:28:32,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-15 11:28:32,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-15 11:28:32,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:28:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:32,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:32,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:32,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:28:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:33,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:33,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:33,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {24835#true} call ULTIMATE.init(); {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:28:33,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-15 11:28:33,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-15 11:28:33,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-15 11:28:33,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {24835#true} call #t~ret1013 := main(); {24835#true} is VALID [2022-04-15 11:28:33,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {24835#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {24835#true} is VALID [2022-04-15 11:28:33,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {24835#true} call _BLAST_init(); {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:33,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:33,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:33,021 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:33,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:33,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:28:33,023 INFO L272 TraceCheckUtils]: 12: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:28:33,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:33,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:28:33,024 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,025 INFO L272 TraceCheckUtils]: 19: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem134 % 256;havoc #t~mem134; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,027 INFO L272 TraceCheckUtils]: 25: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:28:33,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-15 11:28:33,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#false} assume !(1 == ~setEventCalled~0); {24836#false} is VALID [2022-04-15 11:28:33,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#false} assume !(1 == ~customIrp~0); {24836#false} is VALID [2022-04-15 11:28:33,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {24836#false} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-15 11:28:33,028 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#false} call errorFn(); {24836#false} is VALID [2022-04-15 11:28:33,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#false} assume !false; {24836#false} is VALID [2022-04-15 11:28:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:28:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:28:33,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377364924] [2022-04-15 11:28:33,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377364924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:33,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:33,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:33,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:28:33,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515962696] [2022-04-15 11:28:33,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515962696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:33,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:33,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:28:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647782520] [2022-04-15 11:28:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:28:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-15 11:28:33,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:28:33,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:28:33,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:33,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:28:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:28:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:28:33,055 INFO L87 Difference]: Start difference. First operand 1164 states and 1722 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:29:01,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:07,744 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-15 11:29:12,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-15 11:29:14,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:20,450 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-15 11:29:22,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:31,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:35,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:36,689 INFO L93 Difference]: Finished difference Result 2216 states and 3337 transitions. [2022-04-15 11:29:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:29:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-15 11:29:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:29:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-15 11:29:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:29:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-15 11:29:36,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2771 transitions. [2022-04-15 11:29:39,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2771 edges. 2771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:39,929 INFO L225 Difference]: With dead ends: 2216 [2022-04-15 11:29:39,929 INFO L226 Difference]: Without dead ends: 1508 [2022-04-15 11:29:39,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:29:39,932 INFO L913 BasicCegarLoop]: 1349 mSDtfsCounter, 3259 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 1178 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:39,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3290 Valid, 2616 Invalid, 4876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1178 Valid, 3693 Invalid, 5 Unknown, 0 Unchecked, 27.4s Time] [2022-04-15 11:29:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-15 11:29:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1158. [2022-04-15 11:29:40,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:40,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 11:29:40,025 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 11:29:40,026 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 11:29:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:40,095 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-15 11:29:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-15 11:29:40,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:40,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:40,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-15 11:29:40,103 INFO L87 Difference]: Start difference. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-15 11:29:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:40,200 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-15 11:29:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-15 11:29:40,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:40,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:40,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:40,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 11:29:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1710 transitions. [2022-04-15 11:29:40,269 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1710 transitions. Word has length 33 [2022-04-15 11:29:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:29:40,269 INFO L478 AbstractCegarLoop]: Abstraction has 1158 states and 1710 transitions. [2022-04-15 11:29:40,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:29:40,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1158 states and 1710 transitions. [2022-04-15 11:29:42,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1710 edges. 1710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1710 transitions. [2022-04-15 11:29:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:29:42,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:42,334 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:42,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:29:42,335 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 1 times [2022-04-15 11:29:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:42,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654751598] [2022-04-15 11:29:42,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 2 times [2022-04-15 11:29:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:42,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532130731] [2022-04-15 11:29:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:42,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-15 11:29:42,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 11:29:42,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-15 11:29:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:29:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:42,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-15 11:29:42,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 11:29:42,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-15 11:29:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:29:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:42,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {34635#true} call ULTIMATE.init(); {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:29:42,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-15 11:29:42,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 11:29:42,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-15 11:29:42,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {34635#true} call #t~ret1013 := main(); {34635#true} is VALID [2022-04-15 11:29:42,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {34635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {34635#true} is VALID [2022-04-15 11:29:42,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {34635#true} call _BLAST_init(); {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:42,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-15 11:29:42,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 11:29:42,627 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-15 11:29:42,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {34635#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {34635#true} is VALID [2022-04-15 11:29:42,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {34635#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {34635#true} is VALID [2022-04-15 11:29:42,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {34635#true} call stub_driver_init(); {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:29:42,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,630 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {34646#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {34646#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,631 INFO L272 TraceCheckUtils]: 20: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {34646#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:29:42,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {34646#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {34636#false} is VALID [2022-04-15 11:29:42,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {34636#false} assume 0 == ~routine~0; {34636#false} is VALID [2022-04-15 11:29:42,633 INFO L272 TraceCheckUtils]: 28: Hoare triple {34636#false} call #t~ret1004 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {34636#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {34636#false} assume 0 != ~myIrp_PendingReturned~0; {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {34636#false} assume !(0 == ~pended~0); {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L272 TraceCheckUtils]: 32: Hoare triple {34636#false} call errorFn(); {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {34636#false} assume !false; {34636#false} is VALID [2022-04-15 11:29:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:42,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532130731] [2022-04-15 11:29:42,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532130731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:42,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:42,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:29:42,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:42,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654751598] [2022-04-15 11:29:42,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654751598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:42,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:42,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:29:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702723012] [2022-04-15 11:29:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:42,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 11:29:42,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:42,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:29:42,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:42,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:29:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:42,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:29:42,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:29:42,663 INFO L87 Difference]: Start difference. First operand 1158 states and 1710 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:02,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:03,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:05,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:08,047 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-15 11:30:10,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:13,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:17,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:26,724 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-15 11:30:28,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:29,515 INFO L93 Difference]: Finished difference Result 2061 states and 3001 transitions. [2022-04-15 11:30:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:30:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 11:30:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:30:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-15 11:30:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-15 11:30:29,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1787 transitions. [2022-04-15 11:30:31,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:31,612 INFO L225 Difference]: With dead ends: 2061 [2022-04-15 11:30:31,612 INFO L226 Difference]: Without dead ends: 1892 [2022-04-15 11:30:31,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:30:31,613 INFO L913 BasicCegarLoop]: 1099 mSDtfsCounter, 1425 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 337 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:30:31,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1781 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1503 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2022-04-15 11:30:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-04-15 11:30:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2022-04-15 11:30:31,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:30:31,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:30:31,749 INFO L74 IsIncluded]: Start isIncluded. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:30:31,751 INFO L87 Difference]: Start difference. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:30:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:31,858 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-15 11:30:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-15 11:30:31,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:31,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:31,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-15 11:30:31,868 INFO L87 Difference]: Start difference. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-15 11:30:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:30:31,978 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-15 11:30:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-15 11:30:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:30:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:30:31,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:30:31,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:30:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:30:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2381 transitions. [2022-04-15 11:30:32,136 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2381 transitions. Word has length 34 [2022-04-15 11:30:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:30:32,136 INFO L478 AbstractCegarLoop]: Abstraction has 1623 states and 2381 transitions. [2022-04-15 11:30:32,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:32,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1623 states and 2381 transitions. [2022-04-15 11:30:34,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2381 edges. 2381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2381 transitions. [2022-04-15 11:30:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:30:34,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:30:34,948 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:30:34,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:30:34,948 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:30:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:30:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 1 times [2022-04-15 11:30:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:34,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543529975] [2022-04-15 11:30:34,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:30:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 2 times [2022-04-15 11:30:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:30:34,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737320936] [2022-04-15 11:30:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:30:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:30:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:30:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:35,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-15 11:30:35,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-15 11:30:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:30:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:35,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-15 11:30:35,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-15 11:30:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:30:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:30:35,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {45810#true} is VALID [2022-04-15 11:30:35,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-15 11:30:35,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {45810#true} call ULTIMATE.init(); {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:30:35,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-15 11:30:35,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-15 11:30:35,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {45810#true} call #t~ret1013 := main(); {45810#true} is VALID [2022-04-15 11:30:35,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {45810#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {45810#true} is VALID [2022-04-15 11:30:35,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {45810#true} call _BLAST_init(); {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:35,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-15 11:30:35,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,155 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-15 11:30:35,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {45810#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {45810#true} is VALID [2022-04-15 11:30:35,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {45810#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {45810#true} is VALID [2022-04-15 11:30:35,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {45810#true} call stub_driver_init(); {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:30:35,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {45810#true} assume !!(~status~15 >= 0); {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {45810#true} assume !(2 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {45810#true} assume !(3 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {45810#true} assume 4 == ~__BLAST_NONDET___0~0; {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L272 TraceCheckUtils]: 20: Hoare triple {45810#true} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {45810#true} is VALID [2022-04-15 11:30:35,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {45810#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {45810#true} is VALID [2022-04-15 11:30:35,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {45810#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,159 INFO L272 TraceCheckUtils]: 24: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:30:35,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {45811#false} is VALID [2022-04-15 11:30:35,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {45811#false} call errorFn(); {45811#false} is VALID [2022-04-15 11:30:35,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {45811#false} assume !false; {45811#false} is VALID [2022-04-15 11:30:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:30:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:30:35,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737320936] [2022-04-15 11:30:35,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737320936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:35,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:35,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:30:35,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:30:35,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543529975] [2022-04-15 11:30:35,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543529975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:30:35,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:30:35,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:30:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831093330] [2022-04-15 11:30:35,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:30:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 11:30:35,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:30:35,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:35,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:30:35,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:30:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:30:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:30:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:30:35,193 INFO L87 Difference]: Start difference. First operand 1623 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:30:50,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:59,787 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-15 11:31:03,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:07,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:10,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:15,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:19,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:25,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:28,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:30,221 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-15 11:31:33,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:36,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:38,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:41,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:43,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:44,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:46,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:46,916 INFO L93 Difference]: Finished difference Result 1760 states and 2607 transitions. [2022-04-15 11:31:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:31:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 11:31:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:31:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-15 11:31:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:31:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-15 11:31:46,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1223 transitions. [2022-04-15 11:31:48,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1223 edges. 1223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:48,620 INFO L225 Difference]: With dead ends: 1760 [2022-04-15 11:31:48,620 INFO L226 Difference]: Without dead ends: 1756 [2022-04-15 11:31:48,620 INFO L912 BasicCegarLoop]: 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-15 11:31:48,621 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 903 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 360 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:48,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 1471 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1629 Invalid, 13 Unknown, 0 Unchecked, 40.8s Time] [2022-04-15 11:31:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-04-15 11:31:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1622. [2022-04-15 11:31:48,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:48,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:31:48,877 INFO L74 IsIncluded]: Start isIncluded. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:31:48,879 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:31:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:49,005 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-15 11:31:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-15 11:31:49,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:49,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:49,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-15 11:31:49,014 INFO L87 Difference]: Start difference. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-15 11:31:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:49,132 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-15 11:31:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-15 11:31:49,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:49,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:49,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:49,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 11:31:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2378 transitions. [2022-04-15 11:31:49,274 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2378 transitions. Word has length 34 [2022-04-15 11:31:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:49,274 INFO L478 AbstractCegarLoop]: Abstraction has 1622 states and 2378 transitions. [2022-04-15 11:31:49,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:31:49,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1622 states and 2378 transitions. [2022-04-15 11:31:52,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2378 transitions. [2022-04-15 11:31:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 11:31:52,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:52,546 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:52,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:31:52,547 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 1 times [2022-04-15 11:31:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:52,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853835619] [2022-04-15 11:31:52,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 2 times [2022-04-15 11:31:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:52,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765323575] [2022-04-15 11:31:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:52,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-15 11:31:52,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-15 11:31:52,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:31:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:52,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-15 11:31:52,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-15 11:31:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:31:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:52,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {56108#true} is VALID [2022-04-15 11:31:52,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-15 11:31:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:31:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:52,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-15 11:31:52,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-15 11:31:52,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-15 11:31:52,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-15 11:31:52,769 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-15 11:31:52,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {56108#true} call ULTIMATE.init(); {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:31:52,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-15 11:31:52,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-15 11:31:52,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {56108#true} call #t~ret1013 := main(); {56108#true} is VALID [2022-04-15 11:31:52,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {56108#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56108#true} is VALID [2022-04-15 11:31:52,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {56108#true} call _BLAST_init(); {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:52,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-15 11:31:52,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,773 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-15 11:31:52,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {56108#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {56108#true} is VALID [2022-04-15 11:31:52,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {56108#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {56108#true} is VALID [2022-04-15 11:31:52,776 INFO L272 TraceCheckUtils]: 12: Hoare triple {56108#true} call stub_driver_init(); {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:31:52,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {56108#true} is VALID [2022-04-15 11:31:52,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 11:31:52,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-15 11:31:52,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {56108#true} assume !!(~status~15 >= 0); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {56108#true} assume !(2 == ~__BLAST_NONDET___0~0); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {56108#true} assume 3 == ~__BLAST_NONDET___0~0; {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L272 TraceCheckUtils]: 19: Hoare triple {56108#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#true} assume 0 == #t~mem133 % 256;havoc #t~mem133; {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {56108#true} call #t~ret135 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(41);havoc ~cdb~0.base, ~cdb~0.offset;havoc ~inquiryDataPtr~0.base, ~inquiryDataPtr~0.offset;havoc ~attempt~0;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~tmp___11~0;havoc ~tmp___12~0;havoc ~tmp___13~0;havoc ~tmp___14~0;havoc ~tmp___15~0;call ~#deviceParameterHandle~1.base, ~#deviceParameterHandle~1.offset := #Ultimate.allocOnStack(4);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(4);call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem67.base, #t~mem67.offset;havoc #t~mem67.base, #t~mem67.offset; {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L272 TraceCheckUtils]: 24: Hoare triple {56108#true} call #t~ret68 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-15 11:31:52,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(16);havoc ~status~14;havoc ~irpSp~2.base, ~irpSp~2.offset;havoc ~nextIrpSp~1.base, ~nextIrpSp~1.offset;havoc ~irpSp___0~1.base, ~irpSp___0~1.offset;call #t~mem948.base, #t~mem948.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem948.base, #t~mem948.offset;havoc #t~mem948.base, #t~mem948.offset;call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~2.base, ~irpSp~2.offset := #t~mem949.base, #t~mem949.offset;havoc #t~mem949.base, #t~mem949.offset;call #t~mem950.base, #t~mem950.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem950.base, #t~mem950.offset - 36;havoc #t~mem950.base, #t~mem950.offset; {56108#true} is VALID [2022-04-15 11:31:52,778 INFO L272 TraceCheckUtils]: 26: Hoare triple {56108#true} call #t~memmove~res951.base, #t~memmove~res951.offset := #Ultimate.C_memmove(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 28); {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:52,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-15 11:31:52,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {56108#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-15 11:31:52,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {56108#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {56108#true} is VALID [2022-04-15 11:31:52,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-15 11:31:52,779 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-15 11:31:52,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {56108#true} havoc #t~memmove~res951.base, #t~memmove~res951.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56108#true} is VALID [2022-04-15 11:31:52,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {56108#true} assume !(~s~0 != ~NP~0); {56108#true} is VALID [2022-04-15 11:31:52,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {56108#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:31:52,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem952.base, #t~mem952.offset - 36;havoc #t~mem952.base, #t~mem952.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 28 + ~irpSp___0~1.offset, 4);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 32 + ~irpSp___0~1.offset, 4);call write~int(0, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(64, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call #t~mem953 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem953 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem953;call #t~mem954 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem954 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem954;call #t~mem955.base, #t~mem955.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 4); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:31:52,780 INFO L272 TraceCheckUtils]: 36: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~ret956 := IofCallDriver(#t~mem955.base, #t~mem955.offset, ~Irp.base, ~Irp.offset); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:31:52,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:31:52,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56125#(not (= ~routine~0 0))} is VALID [2022-04-15 11:31:52,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {56125#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56109#false} is VALID [2022-04-15 11:31:52,785 INFO L272 TraceCheckUtils]: 40: Hoare triple {56109#false} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56109#false} is VALID [2022-04-15 11:31:52,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {56109#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56109#false} is VALID [2022-04-15 11:31:52,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {56109#false} assume 0 != ~myIrp_PendingReturned~0; {56109#false} is VALID [2022-04-15 11:31:52,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {56109#false} assume !(0 == ~pended~0); {56109#false} is VALID [2022-04-15 11:31:52,786 INFO L272 TraceCheckUtils]: 44: Hoare triple {56109#false} call errorFn(); {56109#false} is VALID [2022-04-15 11:31:52,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {56109#false} assume !false; {56109#false} is VALID [2022-04-15 11:31:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765323575] [2022-04-15 11:31:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765323575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:31:52,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:52,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853835619] [2022-04-15 11:31:52,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853835619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:52,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:52,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:31:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584116597] [2022-04-15 11:31:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-15 11:31:52,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:52,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:31:52,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:52,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:31:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:31:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:31:52,827 INFO L87 Difference]: Start difference. First operand 1622 states and 2378 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:32:19,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:21,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:23,431 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-15 11:32:31,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:33,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:36,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:48,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:50,156 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-15 11:32:53,479 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-15 11:32:57,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:05,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:07,648 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-15 11:33:09,682 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-15 11:33:17,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:21,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:25,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:30,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:34,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:42,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:46,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:47,299 INFO L93 Difference]: Finished difference Result 2729 states and 4036 transitions. [2022-04-15 11:33:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 11:33:47,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-15 11:33:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:33:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-15 11:33:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:33:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-15 11:33:47,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 2095 transitions. [2022-04-15 11:33:49,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2095 edges. 2095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:49,874 INFO L225 Difference]: With dead ends: 2729 [2022-04-15 11:33:49,875 INFO L226 Difference]: Without dead ends: 1590 [2022-04-15 11:33:49,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:33:49,884 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 2049 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 1041 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:33:49,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2075 Valid, 1616 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2545 Invalid, 13 Unknown, 0 Unchecked, 53.2s Time] [2022-04-15 11:33:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-04-15 11:33:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1195. [2022-04-15 11:33:50,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:50,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:33:50,025 INFO L74 IsIncluded]: Start isIncluded. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:33:50,026 INFO L87 Difference]: Start difference. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:33:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:50,121 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-15 11:33:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-15 11:33:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:50,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-15 11:33:50,128 INFO L87 Difference]: Start difference. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-15 11:33:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:50,221 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-15 11:33:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-15 11:33:50,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:50,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:50,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:50,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:33:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1731 transitions. [2022-04-15 11:33:50,343 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1731 transitions. Word has length 46 [2022-04-15 11:33:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:50,344 INFO L478 AbstractCegarLoop]: Abstraction has 1195 states and 1731 transitions. [2022-04-15 11:33:50,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 11:33:50,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1195 states and 1731 transitions. [2022-04-15 11:33:53,358 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-15 11:33:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1731 transitions. [2022-04-15 11:33:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:33:53,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:53,359 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:33:53,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:33:53,360 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 1 times [2022-04-15 11:33:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:53,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221248115] [2022-04-15 11:33:53,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:33:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 2 times [2022-04-15 11:33:53,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:53,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980789519] [2022-04-15 11:33:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:53,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:53,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:33:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:53,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-15 11:33:53,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 11:33:53,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:33:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:53,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {67182#true} is VALID [2022-04-15 11:33:53,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 11:33:53,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 11:33:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:53,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-15 11:33:53,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-15 11:33:53,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-15 11:33:53,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-15 11:33:53,618 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {67182#true} call ULTIMATE.init(); {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:53,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret1013 := main(); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:53,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-15 11:33:53,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 11:33:53,623 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:33:53,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {67182#true} is VALID [2022-04-15 11:33:53,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 11:33:53,625 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,626 INFO L272 TraceCheckUtils]: 18: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret972 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem162.base, #t~mem162.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem162.base, #t~mem162.offset;havoc #t~mem162.base, #t~mem162.offset;call #t~mem163 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem163 % 256);havoc #t~mem163;call #t~mem164 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem164 % 256);havoc #t~mem164;call #t~mem165 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem165 % 256);havoc #t~mem165;call #t~mem166 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem166 % 256;havoc #t~mem166; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,632 INFO L272 TraceCheckUtils]: 24: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret170 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem935.base, #t~mem935.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem935.base, #t~mem935.offset;havoc #t~mem935.base, #t~mem935.offset;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem936.base, #t~mem936.offset - 36;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem937.base, #t~mem937.offset;havoc #t~mem937.base, #t~mem937.offset;call #t~mem938 := read~int(~currentIrpStack~7.base, 12 + ~currentIrpStack~7.offset, 4); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume #t~mem938 % 4294967296 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 4294967296;havoc #t~mem938;call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~1.base, ~irpSp~1.offset := #t~mem939.base, #t~mem939.offset;havoc #t~mem939.base, #t~mem939.offset;call #t~mem940.base, #t~mem940.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem940.base, #t~mem940.offset - 36;havoc #t~mem940.base, #t~mem940.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~memmove~res941.base, #t~memmove~res941.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 28); {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:33:53,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-15 11:33:53,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {67182#true} assume !(#t~loopctr1015 % 4294967296 < size % 4294967296);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-15 11:33:53,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {67182#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296); {67182#true} is VALID [2022-04-15 11:33:53,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-15 11:33:53,635 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc #t~memmove~res941.base, #t~memmove~res941.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem942.base, #t~mem942.offset - 36;havoc #t~mem942.base, #t~mem942.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem943 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem943 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem943;call #t~mem944 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem944 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem944;call #t~mem945.base, #t~mem945.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 4); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,637 INFO L272 TraceCheckUtils]: 37: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret946 := IofCallDriver(#t~mem945.base, #t~mem945.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,639 INFO L272 TraceCheckUtils]: 41: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:33:53,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67183#false} is VALID [2022-04-15 11:33:53,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {67183#false} assume !(0 == ~pended~0); {67183#false} is VALID [2022-04-15 11:33:53,639 INFO L272 TraceCheckUtils]: 45: Hoare triple {67183#false} call errorFn(); {67183#false} is VALID [2022-04-15 11:33:53,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {67183#false} assume !false; {67183#false} is VALID [2022-04-15 11:33:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:33:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:53,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980789519] [2022-04-15 11:33:53,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980789519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:53,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:53,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:33:53,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:53,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221248115] [2022-04-15 11:33:53,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221248115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:53,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:53,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:33:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914573655] [2022-04-15 11:33:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:53,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-15 11:33:53,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:53,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 11:33:53,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:53,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:33:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:33:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:33:53,686 INFO L87 Difference]: Start difference. First operand 1195 states and 1731 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 11:34:08,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:17,401 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-15 11:34:19,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:23,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:25,873 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-15 11:34:27,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:31,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:34,642 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-15 11:34:38,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:40,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:46,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:48,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:50,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:54,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:00,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:05,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:09,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:11,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:13,109 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-15 11:35:15,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:16,120 INFO L93 Difference]: Finished difference Result 2147 states and 3201 transitions. [2022-04-15 11:35:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:35:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-15 11:35:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 11:35:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-15 11:35:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 11:35:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-15 11:35:16,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1894 transitions. [2022-04-15 11:35:18,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1894 edges. 1894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:18,805 INFO L225 Difference]: With dead ends: 2147 [2022-04-15 11:35:18,805 INFO L226 Difference]: Without dead ends: 1478 [2022-04-15 11:35:18,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:35:18,825 INFO L913 BasicCegarLoop]: 738 mSDtfsCounter, 1787 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 753 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:18,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 1168 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2303 Invalid, 11 Unknown, 0 Unchecked, 46.2s Time] [2022-04-15 11:35:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-04-15 11:35:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1192. [2022-04-15 11:35:19,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:19,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:35:19,041 INFO L74 IsIncluded]: Start isIncluded. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:35:19,043 INFO L87 Difference]: Start difference. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:35:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:19,139 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-15 11:35:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-15 11:35:19,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:19,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:19,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-15 11:35:19,147 INFO L87 Difference]: Start difference. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-15 11:35:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:19,241 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-15 11:35:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-15 11:35:19,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:19,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:19,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:19,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 11:35:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1720 transitions. [2022-04-15 11:35:19,368 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1720 transitions. Word has length 47 [2022-04-15 11:35:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:19,368 INFO L478 AbstractCegarLoop]: Abstraction has 1192 states and 1720 transitions. [2022-04-15 11:35:19,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 11:35:19,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1192 states and 1720 transitions. [2022-04-15 11:35:22,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1720 edges. 1720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1720 transitions. [2022-04-15 11:35:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:35:22,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:22,621 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:22,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:35:22,622 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:22,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 1 times [2022-04-15 11:35:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:22,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383844081] [2022-04-15 11:35:22,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:35:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 2 times [2022-04-15 11:35:22,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:22,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785871920] [2022-04-15 11:35:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:22,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-15 11:35:22,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 11:35:22,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-15 11:35:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:35:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:35:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {76852#true} is VALID [2022-04-15 11:35:22,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 11:35:22,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 11:35:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:35:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:22,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,950 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-15 11:35:22,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:35:22,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:35:22,955 INFO L272 TraceCheckUtils]: 3: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,958 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,960 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-15 11:35:22,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {76852#true} call ULTIMATE.init(); {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:35:22,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-15 11:35:22,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 11:35:22,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-15 11:35:22,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {76852#true} call #t~ret1013 := main(); {76852#true} is VALID [2022-04-15 11:35:22,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {76852#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {76852#true} is VALID [2022-04-15 11:35:22,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {76852#true} call _BLAST_init(); {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,964 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,965 INFO L272 TraceCheckUtils]: 12: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {76852#true} is VALID [2022-04-15 11:35:22,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 11:35:22,966 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:35:22,968 INFO L272 TraceCheckUtils]: 20: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-15 11:35:22,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:35:22,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:35:22,970 INFO L272 TraceCheckUtils]: 24: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:35:22,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:35:22,973 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:35:22,974 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {76853#false} assume -2147483648 <= #t~ret974 && #t~ret974 <= 2147483647;~status~15 := #t~ret974;havoc #t~ret974; {76853#false} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {76853#false} assume 0 != ~we_should_unload~0; {76853#false} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-15 11:35:22,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {76853#false} assume !(~s~0 == ~UNLOADED~0); {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {76853#false} assume !(-1 == ~status~15); {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {76853#false} assume !(~s~0 != ~SKIP2~0); {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {76853#false} assume 1 == ~pended~0; {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {76853#false} assume 259 != ~status~15; {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L272 TraceCheckUtils]: 45: Hoare triple {76853#false} call errorFn(); {76853#false} is VALID [2022-04-15 11:35:22,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {76853#false} assume !false; {76853#false} is VALID [2022-04-15 11:35:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:35:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:22,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785871920] [2022-04-15 11:35:22,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785871920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:22,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:22,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:22,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383844081] [2022-04-15 11:35:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383844081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543022075] [2022-04-15 11:35:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:22,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-15 11:35:22,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:22,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:35:23,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:23,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:35:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:35:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:35:23,020 INFO L87 Difference]: Start difference. First operand 1192 states and 1720 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:35:54,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:56,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:00,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:10,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:22,155 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-15 11:36:24,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:30,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:31,681 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-15 11:36:37,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:46,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:48,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-15 11:36:56,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:58,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:03,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:07,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:14,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:16,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:19,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:21,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:24,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:25,629 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-15 11:37:27,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:37:31,945 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-15 11:37:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:41,747 INFO L93 Difference]: Finished difference Result 1825 states and 2709 transitions. [2022-04-15 11:37:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:37:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-15 11:37:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:37:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-15 11:37:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:37:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-15 11:37:41,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 1912 transitions. [2022-04-15 11:37:44,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1912 edges. 1912 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:44,527 INFO L225 Difference]: With dead ends: 1825 [2022-04-15 11:37:44,527 INFO L226 Difference]: Without dead ends: 1764 [2022-04-15 11:37:44,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2022-04-15 11:37:44,528 INFO L913 BasicCegarLoop]: 1030 mSDtfsCounter, 2875 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 4345 mSolverCounterSat, 1401 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 5762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1401 IncrementalHoareTripleChecker+Valid, 4345 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:44,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2908 Valid, 2798 Invalid, 5762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1401 Valid, 4345 Invalid, 16 Unknown, 0 Unchecked, 66.2s Time] [2022-04-15 11:37:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-15 11:37:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1264. [2022-04-15 11:37:44,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:44,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 11:37:44,720 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 11:37:44,721 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 11:37:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:44,815 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-15 11:37:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-15 11:37:44,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:44,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:44,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-15 11:37:44,821 INFO L87 Difference]: Start difference. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-15 11:37:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:44,917 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-15 11:37:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-15 11:37:44,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:44,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:44,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:44,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 11:37:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1808 transitions. [2022-04-15 11:37:44,991 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1808 transitions. Word has length 47 [2022-04-15 11:37:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:44,991 INFO L478 AbstractCegarLoop]: Abstraction has 1264 states and 1808 transitions. [2022-04-15 11:37:44,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:37:44,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1264 states and 1808 transitions. [2022-04-15 11:37:47,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1808 edges. 1808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1808 transitions. [2022-04-15 11:37:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:37:47,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:47,760 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:47,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:37:47,760 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 1 times [2022-04-15 11:37:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:47,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785693243] [2022-04-15 11:37:47,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:37:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 2 times [2022-04-15 11:37:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522760762] [2022-04-15 11:37:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:47,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-15 11:37:47,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-15 11:37:47,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-15 11:37:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 11:37:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:47,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {86665#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:47,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:47,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:47,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:37:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:47,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {86635#true} is VALID [2022-04-15 11:37:47,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-15 11:37:47,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 11:37:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:37:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:48,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-15 11:37:48,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-15 11:37:48,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-15 11:37:48,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-15 11:37:48,048 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-15 11:37:48,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-15 11:37:48,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-15 11:37:48,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {86635#true} is VALID [2022-04-15 11:37:48,049 INFO L272 TraceCheckUtils]: 3: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:48,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-15 11:37:48,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-15 11:37:48,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-15 11:37:48,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {86636#false} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-15 11:37:48,051 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-15 11:37:48,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {86635#true} call ULTIMATE.init(); {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:37:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-15 11:37:48,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-15 11:37:48,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-15 11:37:48,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {86635#true} call #t~ret1013 := main(); {86635#true} is VALID [2022-04-15 11:37:48,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem970.base, 108 + #t~mem970.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {86635#true} is VALID [2022-04-15 11:37:48,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {86635#true} call _BLAST_init(); {86665#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:48,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {86665#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,054 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,055 INFO L272 TraceCheckUtils]: 12: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call stub_driver_init(); {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:48,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {86635#true} is VALID [2022-04-15 11:37:48,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-15 11:37:48,056 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !!(~status~15 >= 0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(2 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(3 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 4 == ~__BLAST_NONDET___0~0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-15 11:37:48,057 INFO L272 TraceCheckUtils]: 20: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:48,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-15 11:37:48,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-15 11:37:48,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem960.base, 36 + #t~mem960.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {86635#true} is VALID [2022-04-15 11:37:48,072 INFO L272 TraceCheckUtils]: 24: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 11:37:48,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-15 11:37:48,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-15 11:37:48,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-15 11:37:48,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {86636#false} assume -2147483648 <= #t~ret963 && #t~ret963 <= 2147483647;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-15 11:37:48,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {86636#false} assume -2147483648 <= #t~ret974 && #t~ret974 <= 2147483647;~status~15 := #t~ret974;havoc #t~ret974; {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {86636#false} assume 0 != ~we_should_unload~0; {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {86636#false} assume !(~s~0 == ~UNLOADED~0); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {86636#false} assume !(-1 == ~status~15); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {86636#false} assume !(~s~0 != ~SKIP2~0); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {86636#false} assume 1 == ~pended~0; {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {86636#false} assume 259 != ~status~15; {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L272 TraceCheckUtils]: 47: Hoare triple {86636#false} call errorFn(); {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {86636#false} assume !false; {86636#false} is VALID [2022-04-15 11:37:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:37:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522760762] [2022-04-15 11:37:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522760762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:48,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:48,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:37:48,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785693243] [2022-04-15 11:37:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785693243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:48,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:48,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:37:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887804747] [2022-04-15 11:37:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-04-15 11:37:48,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:48,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 11:37:48,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:48,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:37:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:37:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:37:48,107 INFO L87 Difference]: Start difference. First operand 1264 states and 1808 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 11:38:09,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:11,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:20,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:28,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:34,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:38,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:40,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:55,450 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 []