/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:22:35,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:22:35,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:22:35,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:22:35,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:22:35,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:22:35,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:22:35,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:22:35,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:22:35,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:22:35,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:22:35,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:22:35,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:22:35,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:22:35,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:22:35,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:22:35,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:22:35,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:22:35,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:22:35,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:22:35,996 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:22:35,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:22:35,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:22:35,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:22:35,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:22:36,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:22:36,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:22:36,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:22:36,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:22:36,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:22:36,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:22:36,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:22:36,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:22:36,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:22:36,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:22:36,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:22:36,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:22:36,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:22:36,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:22:36,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:22:36,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:22:36,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:22:36,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:22:36,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:22:36,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:22:36,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:22:36,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:22:36,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:22:36,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:22:36,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:22:36,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:22:36,023 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:22:36,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:22:36,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:22:36,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:22:36,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:22:36,210 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:22:36,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-08 08:22:36,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8d49262/dfbdb0a225d241e980fd6c75fb1e27b9/FLAGe428a6fde [2022-04-08 08:22:36,820 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:22:36,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-08 08:22:36,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8d49262/dfbdb0a225d241e980fd6c75fb1e27b9/FLAGe428a6fde [2022-04-08 08:22:37,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8d49262/dfbdb0a225d241e980fd6c75fb1e27b9 [2022-04-08 08:22:37,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:22:37,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:22:37,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:22:37,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:22:37,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:22:37,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:22:37" (1/1) ... [2022-04-08 08:22:37,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414a5e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:37, skipping insertion in model container [2022-04-08 08:22:37,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:22:37" (1/1) ... [2022-04-08 08:22:37,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:22:37,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:22:37,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-08 08:22:38,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:22:38,405 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:22:38,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-08 08:22:38,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:22:38,730 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:22:38,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38 WrapperNode [2022-04-08 08:22:38,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:22:38,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:22:38,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:22:38,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:22:38,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:38,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:38,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:38,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:38,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:39,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:39,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:39,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:22:39,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:22:39,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:22:39,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:22:39,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (1/1) ... [2022-04-08 08:22:39,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:22:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:22:39,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:22:39,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:22:39,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-08 08:22:39,175 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-08 08:22:39,176 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-08 08:22:39,176 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-08 08:22:39,176 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-08 08:22:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-08 08:22:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-08 08:22:39,179 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-08 08:22:39,180 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-08 08:22:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-08 08:22:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-08 08:22:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-08 08:22:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-08 08:22:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-08 08:22:39,182 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-08 08:22:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:22:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-08 08:22:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-08 08:22:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-08 08:22:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-08 08:22:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-08 08:22:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-08 08:22:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-08 08:22:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-08 08:22:39,191 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-08 08:22:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-08 08:22:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-08 08:22:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:22:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:22:39,712 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:22:39,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:22:39,737 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:39,773 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:39,773 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:39,773 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:39,780 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:39,780 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:39,791 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:39,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:39,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:39,798 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:39,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:39,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:39,827 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:48,497 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 08:22:48,497 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 08:22:48,512 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:48,518 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:48,518 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:48,519 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:48,532 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:48,532 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:48,533 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:48,548 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:48,548 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:48,548 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:48,564 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:48,564 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:48,567 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,155 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:22:54,155 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:22:54,233 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-08 08:22:54,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-08 08:22:54,393 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,408 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:54,408 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:54,409 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,432 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-08 08:22:54,432 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-08 08:22:54,432 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,436 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:54,437 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:54,437 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:54,443 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:54,468 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,477 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:54,477 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:54,477 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:54,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:22:54,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:22:54,895 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:22:58,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:22:58,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:22:58,396 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,595 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-08 08:23:04,595 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-08 08:23:04,603 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,626 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-08 08:23:04,626 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-08 08:23:04,648 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,652 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:23:04,652 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:23:04,690 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,771 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2022-04-08 08:23:04,772 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2022-04-08 08:23:04,820 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:23:04,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:23:04,954 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:04,958 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:23:04,958 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:23:04,959 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,157 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 08:23:10,158 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 08:23:10,161 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,179 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-08 08:23:10,179 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-08 08:23:10,186 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,194 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-08 08:23:10,194 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-08 08:23:10,203 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,215 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:23:10,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:23:10,475 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-08 08:23:10,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-08 08:23:10,515 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-08 08:23:10,515 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:10,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 08:23:10,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 08:23:10,574 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:23:16,413 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 08:23:16,414 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 08:23:16,475 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:23:16,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:23:16,491 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-08 08:23:16,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:23:16 BoogieIcfgContainer [2022-04-08 08:23:16,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:23:16,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:23:16,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:23:16,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:23:16,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:22:37" (1/3) ... [2022-04-08 08:23:16,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4192c5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:23:16, skipping insertion in model container [2022-04-08 08:23:16,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:22:38" (2/3) ... [2022-04-08 08:23:16,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4192c5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:23:16, skipping insertion in model container [2022-04-08 08:23:16,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:23:16" (3/3) ... [2022-04-08 08:23:16,500 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2022-04-08 08:23:16,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:23:16,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:23:16,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:23:16,560 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:23:16,560 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:23:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-08 08:23:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:23:16,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:23:16,618 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] [2022-04-08 08:23:16,619 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:23:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:23:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 1 times [2022-04-08 08:23:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:23:16,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788169643] [2022-04-08 08:23:16,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:23:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 2 times [2022-04-08 08:23:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:23:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569752085] [2022-04-08 08:23:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:23:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:23:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:23:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:23:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:23:17,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-08 08:23:17,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-08 08:23:17,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-08 08:23:17,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:23:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:23:17,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:23:17,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-08 08:23:17,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-08 08:23:17,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-08 08:23:17,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret1021 := main(); {1264#true} is VALID [2022-04-08 08:23:17,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {1264#true} is VALID [2022-04-08 08:23:17,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 53); {1264#true} is VALID [2022-04-08 08:23:17,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-08 08:23:17,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 36); {1264#true} is VALID [2022-04-08 08:23:17,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-08 08:23:17,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 904); {1264#true} is VALID [2022-04-08 08:23:17,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1264#true} is VALID [2022-04-08 08:23:17,170 INFO L272 TraceCheckUtils]: 12: Hoare triple {1264#true} call _BLAST_init(); {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:23:17,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 08:23:17,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1265#false} is VALID [2022-04-08 08:23:17,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#false} assume !(-1 == ~status~15); {1265#false} is VALID [2022-04-08 08:23:17,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#false} assume !(~s~0 != ~SKIP2~0); {1265#false} is VALID [2022-04-08 08:23:17,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {1265#false} assume !(1 == ~pended~0); {1265#false} is VALID [2022-04-08 08:23:17,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {1265#false} assume ~s~0 == ~DC~0; {1265#false} is VALID [2022-04-08 08:23:17,175 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#false} call errorFn(); {1265#false} is VALID [2022-04-08 08:23:17,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-08 08:23:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:23:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:23:17,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569752085] [2022-04-08 08:23:17,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569752085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:23:17,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:23:17,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:23:17,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:23:17,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788169643] [2022-04-08 08:23:17,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788169643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:23:17,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:23:17,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:23:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042135579] [2022-04-08 08:23:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:23:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-08 08:23:17,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:23:17,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:23:17,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:23:17,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:23:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:23:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:23:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:23:17,262 INFO L87 Difference]: Start difference. First operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:23:29,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:33,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:40,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:44,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:48,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:51,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:54,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:23:59,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-08 08:24:01,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:10,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:14,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:16,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:24:17,365 INFO L93 Difference]: Finished difference Result 1537 states and 2438 transitions. [2022-04-08 08:24:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:24:17,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-08 08:24:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:24:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:24:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-08 08:24:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:24:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-08 08:24:17,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2438 transitions. [2022-04-08 08:24:20,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2438 edges. 2438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:20,292 INFO L225 Difference]: With dead ends: 1537 [2022-04-08 08:24:20,292 INFO L226 Difference]: Without dead ends: 842 [2022-04-08 08:24:20,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:24:20,305 INFO L913 BasicCegarLoop]: 930 mSDtfsCounter, 484 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 187 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:24:20,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 1302 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1971 Invalid, 9 Unknown, 0 Unchecked, 31.4s Time] [2022-04-08 08:24:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-08 08:24:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 679. [2022-04-08 08:24:20,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:24:20,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:24:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:24:20,443 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:24:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:24:20,541 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-08 08:24:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-08 08:24:20,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:24:20,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:24:20,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-08 08:24:20,565 INFO L87 Difference]: Start difference. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-08 08:24:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:24:20,598 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-08 08:24:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-08 08:24:20,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:24:20,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:24:20,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:24:20,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:24:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 08:24:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 991 transitions. [2022-04-08 08:24:20,634 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 991 transitions. Word has length 26 [2022-04-08 08:24:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:24:20,635 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 991 transitions. [2022-04-08 08:24:20,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 08:24:20,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 991 transitions. [2022-04-08 08:24:21,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 991 transitions. [2022-04-08 08:24:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:24:21,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:24:21,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:24:21,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:24:21,748 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:24:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:24:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 1 times [2022-04-08 08:24:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:21,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913966851] [2022-04-08 08:24:21,749 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:24:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 2 times [2022-04-08 08:24:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:24:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849809949] [2022-04-08 08:24:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:24:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:24:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:24:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:21,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-08 08:24:21,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-08 08:24:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:24:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:21,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-08 08:24:21,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-08 08:24:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:24:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:21,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {7398#true} call ULTIMATE.init(); {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:24:21,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-08 08:24:21,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-08 08:24:21,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#true} call #t~ret1021 := main(); {7398#true} is VALID [2022-04-08 08:24:21,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 53); {7398#true} is VALID [2022-04-08 08:24:21,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 36); {7398#true} is VALID [2022-04-08 08:24:21,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 904); {7398#true} is VALID [2022-04-08 08:24:21,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7398#true} is VALID [2022-04-08 08:24:21,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {7398#true} call _BLAST_init(); {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:24:21,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-08 08:24:21,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-08 08:24:21,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {7398#true} is VALID [2022-04-08 08:24:21,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {7398#true} is VALID [2022-04-08 08:24:21,993 INFO L272 TraceCheckUtils]: 18: Hoare triple {7398#true} call stub_driver_init(); {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:24:21,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,994 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {7409#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,996 INFO L272 TraceCheckUtils]: 26: Hoare triple {7409#(= ~s~0 ~NP~0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:24:21,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7399#false} is VALID [2022-04-08 08:24:21,997 INFO L272 TraceCheckUtils]: 29: Hoare triple {7399#false} call errorFn(); {7399#false} is VALID [2022-04-08 08:24:21,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-04-08 08:24:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:24:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:24:21,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849809949] [2022-04-08 08:24:21,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849809949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:21,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:21,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:24:21,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:24:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913966851] [2022-04-08 08:24:22,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913966851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:22,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:22,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:24:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151390434] [2022-04-08 08:24:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:24:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-08 08:24:22,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:24:22,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:24:22,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:22,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:24:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:24:22,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:24:22,031 INFO L87 Difference]: Start difference. First operand 679 states and 991 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:24:37,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:48,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:51,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:24:53,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:02,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:03,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:05,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:05,993 INFO L93 Difference]: Finished difference Result 1457 states and 2151 transitions. [2022-04-08 08:25:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:25:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-08 08:25:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:25:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:25:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-08 08:25:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:25:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-08 08:25:06,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2151 transitions. [2022-04-08 08:25:08,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2151 edges. 2151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:08,433 INFO L225 Difference]: With dead ends: 1457 [2022-04-08 08:25:08,433 INFO L226 Difference]: Without dead ends: 1180 [2022-04-08 08:25:08,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:25:08,435 INFO L913 BasicCegarLoop]: 1218 mSDtfsCounter, 1461 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 356 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:25:08,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1953 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2650 Invalid, 5 Unknown, 0 Unchecked, 19.3s Time] [2022-04-08 08:25:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-04-08 08:25:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 991. [2022-04-08 08:25:08,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:25:08,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:25:08,533 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:25:08,536 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:25:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:08,600 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-08 08:25:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-08 08:25:08,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:08,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:08,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-08 08:25:08,609 INFO L87 Difference]: Start difference. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-08 08:25:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:08,667 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-08 08:25:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-08 08:25:08,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:08,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:08,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:25:08,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:25:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 08:25:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1448 transitions. [2022-04-08 08:25:08,740 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1448 transitions. Word has length 31 [2022-04-08 08:25:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:25:08,741 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1448 transitions. [2022-04-08 08:25:08,741 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), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:25:08,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1448 transitions. [2022-04-08 08:25:10,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1448 transitions. [2022-04-08 08:25:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 08:25:10,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:25:10,650 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] [2022-04-08 08:25:10,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:25:10,651 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:25:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:25:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 1 times [2022-04-08 08:25:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:25:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835163069] [2022-04-08 08:25:10,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:25:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 2 times [2022-04-08 08:25:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:25:10,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286097675] [2022-04-08 08:25:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:25:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:25:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:10,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:25:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:10,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-08 08:25:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:25:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:10,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-08 08:25:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:25:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:25:10,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {14677#true} is VALID [2022-04-08 08:25:10,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-08 08:25:10,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {14677#true} call ULTIMATE.init(); {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:25:10,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {14677#true} call #t~ret1021 := main(); {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {14677#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 53); {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 36); {14677#true} is VALID [2022-04-08 08:25:10,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 904); {14677#true} is VALID [2022-04-08 08:25:10,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {14677#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14677#true} is VALID [2022-04-08 08:25:10,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {14677#true} call _BLAST_init(); {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:25:10,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,904 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-08 08:25:10,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {14677#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {14677#true} is VALID [2022-04-08 08:25:10,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {14677#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {14677#true} is VALID [2022-04-08 08:25:10,905 INFO L272 TraceCheckUtils]: 18: Hoare triple {14677#true} call stub_driver_init(); {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:25:10,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {14677#true} assume !!(~status~15 >= 0); {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {14677#true} assume !(2 == ~__BLAST_NONDET___0~0); {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {14677#true} assume 3 == ~__BLAST_NONDET___0~0; {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L272 TraceCheckUtils]: 25: Hoare triple {14677#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14677#true} is VALID [2022-04-08 08:25:10,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {14677#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-08 08:25:10,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {14677#true} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-08 08:25:10,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {14677#true} assume 22 == #t~mem131 % 256;havoc #t~mem131; {14677#true} is VALID [2022-04-08 08:25:10,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#true} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14677#true} is VALID [2022-04-08 08:25:10,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {14677#true} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {14677#true} is VALID [2022-04-08 08:25:10,910 INFO L272 TraceCheckUtils]: 31: Hoare triple {14677#true} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14677#true} is VALID [2022-04-08 08:25:10,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {14677#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {14677#true} is VALID [2022-04-08 08:25:10,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {14677#true} assume !(~s~0 == ~MPR3~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:25:10,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:25:10,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14678#false} is VALID [2022-04-08 08:25:10,920 INFO L272 TraceCheckUtils]: 36: Hoare triple {14678#false} call errorFn(); {14678#false} is VALID [2022-04-08 08:25:10,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {14678#false} assume !false; {14678#false} is VALID [2022-04-08 08:25:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:25:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:25:10,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286097675] [2022-04-08 08:25:10,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286097675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:25:10,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:25:10,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:25:10,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:25:10,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835163069] [2022-04-08 08:25:10,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835163069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:25:10,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:25:10,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:25:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319331906] [2022-04-08 08:25:10,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:25:10,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-08 08:25:10,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:25:10,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:25:10,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:10,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:25:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:25:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:25:10,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:25:10,950 INFO L87 Difference]: Start difference. First operand 991 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:25:24,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:30,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:32,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:40,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:43,845 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-08 08:25:53,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:25:55,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-08 08:26:01,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:07,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:10,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:17,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:23,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:27,420 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-08 08:26:29,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:35,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:41,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:45,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:26:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:45,792 INFO L93 Difference]: Finished difference Result 2293 states and 3447 transitions. [2022-04-08 08:26:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:26:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-08 08:26:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:26:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:26:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-08 08:26:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:26:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-08 08:26:45,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2367 transitions. [2022-04-08 08:26:48,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2367 edges. 2367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:48,700 INFO L225 Difference]: With dead ends: 2293 [2022-04-08 08:26:48,700 INFO L226 Difference]: Without dead ends: 1837 [2022-04-08 08:26:48,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:26:48,704 INFO L913 BasicCegarLoop]: 1375 mSDtfsCounter, 1580 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 517 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:26:48,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1632 Valid, 2171 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2332 Invalid, 12 Unknown, 0 Unchecked, 46.3s Time] [2022-04-08 08:26:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-04-08 08:26:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1172. [2022-04-08 08:26:48,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:26:48,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:26:48,853 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:26:48,855 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:26:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:48,959 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-08 08:26:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-08 08:26:48,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:48,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:48,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-08 08:26:48,968 INFO L87 Difference]: Start difference. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-08 08:26:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:26:49,068 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-08 08:26:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-08 08:26:49,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:26:49,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:26:49,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:26:49,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:26:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 08:26:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1733 transitions. [2022-04-08 08:26:49,139 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1733 transitions. Word has length 38 [2022-04-08 08:26:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:26:49,139 INFO L478 AbstractCegarLoop]: Abstraction has 1172 states and 1733 transitions. [2022-04-08 08:26:49,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:26:49,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1172 states and 1733 transitions. [2022-04-08 08:26:51,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1733 transitions. [2022-04-08 08:26:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 08:26:51,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:26:51,438 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] [2022-04-08 08:26:51,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:26:51,438 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:26:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:26:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 1 times [2022-04-08 08:26:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916744804] [2022-04-08 08:26:51,439 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:26:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 2 times [2022-04-08 08:26:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:26:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423735848] [2022-04-08 08:26:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:26:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:26:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:26:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:51,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-08 08:26:51,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-08 08:26:51,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-08 08:26:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:26:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:51,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:26:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:51,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:51,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:51,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {25303#true} call ULTIMATE.init(); {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {25303#true} call #t~ret1021 := main(); {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {25303#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 53); {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 36); {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-08 08:26:51,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 904); {25303#true} is VALID [2022-04-08 08:26:51,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {25303#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {25303#true} is VALID [2022-04-08 08:26:51,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {25303#true} call _BLAST_init(); {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:26:51,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,744 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(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; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 08:26:51,745 INFO L272 TraceCheckUtils]: 18: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:26:51,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:51,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:26:51,746 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,747 INFO L272 TraceCheckUtils]: 25: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem131 % 256;havoc #t~mem131; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,749 INFO L272 TraceCheckUtils]: 31: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:26:51,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-08 08:26:51,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {25304#false} assume !(1 == ~setEventCalled~0); {25304#false} is VALID [2022-04-08 08:26:51,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {25304#false} assume !(1 == ~customIrp~0); {25304#false} is VALID [2022-04-08 08:26:51,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {25304#false} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-08 08:26:51,751 INFO L272 TraceCheckUtils]: 37: Hoare triple {25304#false} call errorFn(); {25304#false} is VALID [2022-04-08 08:26:51,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {25304#false} assume !false; {25304#false} is VALID [2022-04-08 08:26:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:26:51,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:26:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423735848] [2022-04-08 08:26:51,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423735848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:51,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:51,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:26:51,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:26:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916744804] [2022-04-08 08:26:51,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916744804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:51,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:51,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:26:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761981808] [2022-04-08 08:26:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:26:51,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-08 08:26:51,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:26:51,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:26:51,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:51,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:26:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:26:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:26:51,781 INFO L87 Difference]: Start difference. First operand 1172 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:27:13,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:16,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:19,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:21,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:25,075 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-08 08:27:28,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:32,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:34,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:38,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:42,198 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-08 08:27:45,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:47,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:27:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:48,188 INFO L93 Difference]: Finished difference Result 2221 states and 3345 transitions. [2022-04-08 08:27:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:27:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-08 08:27:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:27:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:27:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-08 08:27:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:27:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-08 08:27:48,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2779 transitions. [2022-04-08 08:27:51,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2779 edges. 2779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:51,279 INFO L225 Difference]: With dead ends: 2221 [2022-04-08 08:27:51,279 INFO L226 Difference]: Without dead ends: 1514 [2022-04-08 08:27:51,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:27:51,282 INFO L913 BasicCegarLoop]: 1358 mSDtfsCounter, 3783 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 1396 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1396 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:27:51,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3814 Valid, 2589 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1396 Valid, 1592 Invalid, 9 Unknown, 0 Unchecked, 29.1s Time] [2022-04-08 08:27:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-04-08 08:27:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1166. [2022-04-08 08:27:51,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:27:51,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:27:51,410 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:27:51,420 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:27:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:51,484 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-08 08:27:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-08 08:27:51,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:51,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:51,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-08 08:27:51,491 INFO L87 Difference]: Start difference. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-08 08:27:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:27:51,556 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-08 08:27:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-08 08:27:51,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:27:51,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:27:51,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:27:51,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:27:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 08:27:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1721 transitions. [2022-04-08 08:27:51,640 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1721 transitions. Word has length 39 [2022-04-08 08:27:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:27:51,640 INFO L478 AbstractCegarLoop]: Abstraction has 1166 states and 1721 transitions. [2022-04-08 08:27:51,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:27:51,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1166 states and 1721 transitions. [2022-04-08 08:27:54,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1721 transitions. [2022-04-08 08:27:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 08:27:54,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:27:54,200 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] [2022-04-08 08:27:54,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:27:54,200 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:27:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:27:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 1 times [2022-04-08 08:27:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:54,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875951024] [2022-04-08 08:27:54,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:27:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 2 times [2022-04-08 08:27:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:27:54,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968613249] [2022-04-08 08:27:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:27:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:27:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:27:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:54,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-08 08:27:54,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-08 08:27:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:27:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:54,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-08 08:27:54,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-08 08:27:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:27:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:27:54,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {35141#true} call ULTIMATE.init(); {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:27:54,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {35141#true} call #t~ret1021 := main(); {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {35141#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 53); {35141#true} is VALID [2022-04-08 08:27:54,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 36); {35141#true} is VALID [2022-04-08 08:27:54,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 904); {35141#true} is VALID [2022-04-08 08:27:54,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {35141#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {35141#true} is VALID [2022-04-08 08:27:54,572 INFO L272 TraceCheckUtils]: 12: Hoare triple {35141#true} call _BLAST_init(); {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:27:54,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-08 08:27:54,572 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-08 08:27:54,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {35141#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {35141#true} is VALID [2022-04-08 08:27:54,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {35141#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {35141#true} is VALID [2022-04-08 08:27:54,573 INFO L272 TraceCheckUtils]: 18: Hoare triple {35141#true} call stub_driver_init(); {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:27:54,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,578 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {35152#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {35152#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,580 INFO L272 TraceCheckUtils]: 26: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {35152#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,581 INFO L272 TraceCheckUtils]: 30: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:27:54,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {35152#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {35142#false} is VALID [2022-04-08 08:27:54,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {35142#false} assume 0 == ~routine~0; {35142#false} is VALID [2022-04-08 08:27:54,582 INFO L272 TraceCheckUtils]: 34: Hoare triple {35142#false} call #t~ret1012 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {35142#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {35142#false} assume 0 != ~myIrp_PendingReturned~0; {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {35142#false} assume !(0 == ~pended~0); {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L272 TraceCheckUtils]: 38: Hoare triple {35142#false} call errorFn(); {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {35142#false} assume !false; {35142#false} is VALID [2022-04-08 08:27:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:27:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:27:54,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968613249] [2022-04-08 08:27:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968613249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:54,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:54,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:27:54,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:27:54,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875951024] [2022-04-08 08:27:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875951024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:27:54,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:27:54,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:27:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767342995] [2022-04-08 08:27:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:27:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-08 08:27:54,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:27:54,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:27:54,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:27:54,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:27:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:27:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:27:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:27:54,624 INFO L87 Difference]: Start difference. First operand 1166 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:09,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:11,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-08 08:28:18,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:21,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:24,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:26,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:34,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:44,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:46,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:51,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:28:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:53,710 INFO L93 Difference]: Finished difference Result 2067 states and 3010 transitions. [2022-04-08 08:28:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:28:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-08 08:28:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:28:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-08 08:28:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-08 08:28:53,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1796 transitions. [2022-04-08 08:28:55,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1796 edges. 1796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:55,995 INFO L225 Difference]: With dead ends: 2067 [2022-04-08 08:28:55,995 INFO L226 Difference]: Without dead ends: 1899 [2022-04-08 08:28:55,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:28:55,996 INFO L913 BasicCegarLoop]: 1135 mSDtfsCounter, 1444 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 333 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:28:55,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1831 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1525 Invalid, 6 Unknown, 0 Unchecked, 25.3s Time] [2022-04-08 08:28:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-08 08:28:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1631. [2022-04-08 08:28:56,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:28:56,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:28:56,157 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:28:56,159 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:28:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:56,262 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-08 08:28:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-08 08:28:56,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:28:56,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:28:56,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-08 08:28:56,272 INFO L87 Difference]: Start difference. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-08 08:28:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:28:56,376 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-08 08:28:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-08 08:28:56,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:28:56,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:28:56,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:28:56,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:28:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:28:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2392 transitions. [2022-04-08 08:28:56,517 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2392 transitions. Word has length 40 [2022-04-08 08:28:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:28:56,518 INFO L478 AbstractCegarLoop]: Abstraction has 1631 states and 2392 transitions. [2022-04-08 08:28:56,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:28:56,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1631 states and 2392 transitions. [2022-04-08 08:28:59,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2392 edges. 2392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:28:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2392 transitions. [2022-04-08 08:28:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 08:28:59,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:28:59,905 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] [2022-04-08 08:28:59,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:28:59,906 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:28:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:28:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 1 times [2022-04-08 08:28:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:28:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1681409422] [2022-04-08 08:28:59,906 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:28:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 2 times [2022-04-08 08:28:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:28:59,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019408289] [2022-04-08 08:28:59,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:28:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:28:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:29:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:00,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-08 08:29:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:29:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:00,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-08 08:29:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:29:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:29:00,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {46358#true} is VALID [2022-04-08 08:29:00,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-08 08:29:00,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {46358#true} call ULTIMATE.init(); {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:29:00,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {46358#true} call #t~ret1021 := main(); {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {46358#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 53); {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 36); {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 904); {46358#true} is VALID [2022-04-08 08:29:00,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {46358#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {46358#true} is VALID [2022-04-08 08:29:00,113 INFO L272 TraceCheckUtils]: 12: Hoare triple {46358#true} call _BLAST_init(); {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:29:00,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-08 08:29:00,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {46358#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {46358#true} is VALID [2022-04-08 08:29:00,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {46358#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {46358#true} is VALID [2022-04-08 08:29:00,119 INFO L272 TraceCheckUtils]: 18: Hoare triple {46358#true} call stub_driver_init(); {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:29:00,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {46358#true} is VALID [2022-04-08 08:29:00,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-08 08:29:00,120 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {46358#true} assume !!(~status~15 >= 0); {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {46358#true} assume !(2 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {46358#true} assume !(3 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {46358#true} assume 4 == ~__BLAST_NONDET___0~0; {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L272 TraceCheckUtils]: 26: Hoare triple {46358#true} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {46358#true} is VALID [2022-04-08 08:29:00,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {46358#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {46358#true} is VALID [2022-04-08 08:29:00,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {46358#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,125 INFO L272 TraceCheckUtils]: 30: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:29:00,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {46359#false} is VALID [2022-04-08 08:29:00,127 INFO L272 TraceCheckUtils]: 38: Hoare triple {46359#false} call errorFn(); {46359#false} is VALID [2022-04-08 08:29:00,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {46359#false} assume !false; {46359#false} is VALID [2022-04-08 08:29:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:29:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:29:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019408289] [2022-04-08 08:29:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019408289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:29:00,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:29:00,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:29:00,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:29:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1681409422] [2022-04-08 08:29:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1681409422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:29:00,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:29:00,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:29:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379508712] [2022-04-08 08:29:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:29:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-08 08:29:00,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:29:00,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:29:00,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:29:00,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:29:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:29:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:29:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:29:00,157 INFO L87 Difference]: Start difference. First operand 1631 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:29:14,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:19,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:22,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:28,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:32,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:36,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:37,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:43,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:46,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:50,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:29:54,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-08 08:29:58,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:08,471 INFO L93 Difference]: Finished difference Result 1768 states and 2618 transitions. [2022-04-08 08:30:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:30:08,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-08 08:30:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:30:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-08 08:30:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-08 08:30:08,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1234 transitions. [2022-04-08 08:30:10,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:10,288 INFO L225 Difference]: With dead ends: 1768 [2022-04-08 08:30:10,288 INFO L226 Difference]: Without dead ends: 1764 [2022-04-08 08:30:10,288 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-08 08:30:10,289 INFO L913 BasicCegarLoop]: 904 mSDtfsCounter, 939 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 360 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:30:10,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 1479 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1629 Invalid, 10 Unknown, 0 Unchecked, 33.7s Time] [2022-04-08 08:30:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-08 08:30:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1630. [2022-04-08 08:30:10,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:30:10,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:10,426 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:10,428 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:10,514 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-08 08:30:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-08 08:30:10,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:10,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:10,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-08 08:30:10,521 INFO L87 Difference]: Start difference. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-08 08:30:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:30:10,608 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-08 08:30:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-08 08:30:10,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:30:10,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:30:10,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:30:10,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:30:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 08:30:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2389 transitions. [2022-04-08 08:30:10,760 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2389 transitions. Word has length 40 [2022-04-08 08:30:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:30:10,760 INFO L478 AbstractCegarLoop]: Abstraction has 1630 states and 2389 transitions. [2022-04-08 08:30:10,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:30:10,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1630 states and 2389 transitions. [2022-04-08 08:30:14,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2389 edges. 2389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2389 transitions. [2022-04-08 08:30:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 08:30:14,136 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:30:14,136 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:30:14,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:30:14,136 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:30:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:30:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 1 times [2022-04-08 08:30:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:14,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943966183] [2022-04-08 08:30:14,137 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:30:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 2 times [2022-04-08 08:30:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:30:14,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110004675] [2022-04-08 08:30:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:30:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:30:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:30:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:14,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-08 08:30:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:30:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:14,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-08 08:30:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:30:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:14,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {56704#true} is VALID [2022-04-08 08:30:14,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-08 08:30:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 08:30:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:30:14,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-08 08:30:14,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-08 08:30:14,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-08 08:30:14,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-08 08:30:14,389 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {56704#true} call ULTIMATE.init(); {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:30:14,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {56704#true} call #t~ret1021 := main(); {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {56704#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 53); {56704#true} is VALID [2022-04-08 08:30:14,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 36); {56704#true} is VALID [2022-04-08 08:30:14,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 904); {56704#true} is VALID [2022-04-08 08:30:14,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {56704#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56704#true} is VALID [2022-04-08 08:30:14,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {56704#true} call _BLAST_init(); {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:30:14,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,393 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-08 08:30:14,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {56704#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {56704#true} is VALID [2022-04-08 08:30:14,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {56704#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {56704#true} is VALID [2022-04-08 08:30:14,394 INFO L272 TraceCheckUtils]: 18: Hoare triple {56704#true} call stub_driver_init(); {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:30:14,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {56704#true} is VALID [2022-04-08 08:30:14,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-08 08:30:14,394 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-08 08:30:14,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {56704#true} assume !!(~status~15 >= 0); {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {56704#true} assume !(2 == ~__BLAST_NONDET___0~0); {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {56704#true} assume 3 == ~__BLAST_NONDET___0~0; {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L272 TraceCheckUtils]: 25: Hoare triple {56704#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {56704#true} assume 0 == #t~mem130 % 256;havoc #t~mem130; {56704#true} is VALID [2022-04-08 08:30:14,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {56704#true} call #t~ret132 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-08 08:30:14,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(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~mem64.base, #t~mem64.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset; {56704#true} is VALID [2022-04-08 08:30:14,396 INFO L272 TraceCheckUtils]: 30: Hoare triple {56704#true} call #t~ret65 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-08 08:30:14,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(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~mem945.base, #t~mem945.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem945.base, #t~mem945.offset;havoc #t~mem945.base, #t~mem945.offset;call #t~mem946.base, #t~mem946.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~2.base, ~irpSp~2.offset := #t~mem946.base, #t~mem946.offset;havoc #t~mem946.base, #t~mem946.offset;call #t~mem947.base, #t~mem947.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem947.base, #t~mem947.offset - 36;havoc #t~mem947.base, #t~mem947.offset; {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L272 TraceCheckUtils]: 32: Hoare triple {56704#true} call #t~memcpy~res948.base, #t~memcpy~res948.offset := #Ultimate.C_memcpy(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 28); {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {56704#true} havoc #t~memcpy~res948.base, #t~memcpy~res948.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56704#true} is VALID [2022-04-08 08:30:14,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {56704#true} assume !(~s~0 != ~NP~0); {56704#true} is VALID [2022-04-08 08:30:14,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {56704#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:30:14,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem949.base, #t~mem949.offset - 36;havoc #t~mem949.base, #t~mem949.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~mem950 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem950 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem950;call #t~mem951 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem951 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem951;call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 4); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:30:14,405 INFO L272 TraceCheckUtils]: 42: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~ret953 := IofCallDriver(#t~mem952.base, #t~mem952.offset, ~Irp.base, ~Irp.offset); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:30:14,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 08:30:14,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56721#(not (= ~routine~0 0))} is VALID [2022-04-08 08:30:14,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {56721#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56705#false} is VALID [2022-04-08 08:30:14,406 INFO L272 TraceCheckUtils]: 46: Hoare triple {56705#false} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56705#false} is VALID [2022-04-08 08:30:14,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {56705#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56705#false} is VALID [2022-04-08 08:30:14,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {56705#false} assume 0 != ~myIrp_PendingReturned~0; {56705#false} is VALID [2022-04-08 08:30:14,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {56705#false} assume !(0 == ~pended~0); {56705#false} is VALID [2022-04-08 08:30:14,410 INFO L272 TraceCheckUtils]: 50: Hoare triple {56705#false} call errorFn(); {56705#false} is VALID [2022-04-08 08:30:14,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {56705#false} assume !false; {56705#false} is VALID [2022-04-08 08:30:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:30:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:30:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110004675] [2022-04-08 08:30:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110004675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:14,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:14,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:30:14,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:30:14,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1943966183] [2022-04-08 08:30:14,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1943966183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:30:14,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:30:14,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:30:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538249588] [2022-04-08 08:30:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:30:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-08 08:30:14,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:30:14,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:30:14,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:30:14,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:30:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:30:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:30:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:30:14,461 INFO L87 Difference]: Start difference. First operand 1630 states and 2389 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:30:39,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:41,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-08 08:30:43,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:47,648 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-08 08:30:49,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:30:57,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:03,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:07,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:09,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:12,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:14,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:18,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:29,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:31,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:33,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:38,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:46,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:53,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:56,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:31:59,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:01,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:05,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:06,474 INFO L93 Difference]: Finished difference Result 2734 states and 4044 transitions. [2022-04-08 08:32:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 08:32:06,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-08 08:32:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:32:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:32:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-08 08:32:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:32:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-08 08:32:06,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 2103 transitions. [2022-04-08 08:32:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:09,215 INFO L225 Difference]: With dead ends: 2734 [2022-04-08 08:32:09,215 INFO L226 Difference]: Without dead ends: 1596 [2022-04-08 08:32:09,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:32:09,222 INFO L913 BasicCegarLoop]: 922 mSDtfsCounter, 2060 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3243 mSolverCounterSat, 1015 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3243 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:32:09,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2086 Valid, 1659 Invalid, 4278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3243 Invalid, 20 Unknown, 0 Unchecked, 63.3s Time] [2022-04-08 08:32:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-08 08:32:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1203. [2022-04-08 08:32:09,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:32:09,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:32:09,441 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:32:09,442 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:32:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:09,564 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-08 08:32:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-08 08:32:09,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:09,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:09,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-08 08:32:09,573 INFO L87 Difference]: Start difference. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-08 08:32:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:09,695 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-08 08:32:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-08 08:32:09,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:09,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:09,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:32:09,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:32:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:32:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1742 transitions. [2022-04-08 08:32:09,807 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1742 transitions. Word has length 52 [2022-04-08 08:32:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:32:09,807 INFO L478 AbstractCegarLoop]: Abstraction has 1203 states and 1742 transitions. [2022-04-08 08:32:09,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 08:32:09,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1203 states and 1742 transitions. [2022-04-08 08:32:12,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1742 edges. 1742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1742 transitions. [2022-04-08 08:32:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 08:32:12,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:32:12,642 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:32:12,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:32:12,643 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:32:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:32:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 1 times [2022-04-08 08:32:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:12,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729196109] [2022-04-08 08:32:12,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:32:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 2 times [2022-04-08 08:32:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:32:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187648403] [2022-04-08 08:32:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:32:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:32:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:32:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:32:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-08 08:32:12,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-08 08:32:12,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:32:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {67819#true} is VALID [2022-04-08 08:32:12,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-08 08:32:12,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-08 08:32:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-08 08:32:12,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-08 08:32:12,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-08 08:32:12,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-08 08:32:12,905 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {67819#true} call ULTIMATE.init(); {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:32:12,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1021 := main(); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 53); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 36); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 904); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,911 INFO L272 TraceCheckUtils]: 12: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:32:12,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-08 08:32:12,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-08 08:32:12,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,913 INFO L272 TraceCheckUtils]: 18: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:32:12,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {67819#true} is VALID [2022-04-08 08:32:12,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-08 08:32:12,914 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,917 INFO L272 TraceCheckUtils]: 24: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret978 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem159.base, #t~mem159.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem159.base, #t~mem159.offset;havoc #t~mem159.base, #t~mem159.offset;call #t~mem160 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem160 % 256);havoc #t~mem160;call #t~mem161 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem161 % 256);havoc #t~mem161;call #t~mem162 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem162 % 256);havoc #t~mem162;call #t~mem163 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem163 % 256;havoc #t~mem163; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,920 INFO L272 TraceCheckUtils]: 30: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret167 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem932.base, #t~mem932.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem932.base, #t~mem932.offset;havoc #t~mem932.base, #t~mem932.offset;call #t~mem933.base, #t~mem933.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem933.base, #t~mem933.offset - 36;havoc #t~mem933.base, #t~mem933.offset;call #t~mem934.base, #t~mem934.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem934.base, #t~mem934.offset;havoc #t~mem934.base, #t~mem934.offset;call #t~mem935 := read~int(~currentIrpStack~7.base, 12 + ~currentIrpStack~7.offset, 4); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume #t~mem935 % 4294967296 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 4294967296;havoc #t~mem935;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~1.base, ~irpSp~1.offset := #t~mem936.base, #t~mem936.offset;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem937.base, #t~mem937.offset - 36;havoc #t~mem937.base, #t~mem937.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,922 INFO L272 TraceCheckUtils]: 33: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~memcpy~res938.base, #t~memcpy~res938.offset := #Ultimate.C_memcpy(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 28); {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 08:32:12,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-08 08:32:12,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-08 08:32:12,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-08 08:32:12,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-08 08:32:12,923 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc #t~memcpy~res938.base, #t~memcpy~res938.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem939.base, #t~mem939.offset - 36;havoc #t~mem939.base, #t~mem939.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~mem940 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem940 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem940;call #t~mem941 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem941 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem941;call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 4); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,924 INFO L272 TraceCheckUtils]: 43: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret943 := IofCallDriver(#t~mem942.base, #t~mem942.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,926 INFO L272 TraceCheckUtils]: 47: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 08:32:12,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67820#false} is VALID [2022-04-08 08:32:12,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {67820#false} assume !(0 == ~pended~0); {67820#false} is VALID [2022-04-08 08:32:12,927 INFO L272 TraceCheckUtils]: 51: Hoare triple {67820#false} call errorFn(); {67820#false} is VALID [2022-04-08 08:32:12,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {67820#false} assume !false; {67820#false} is VALID [2022-04-08 08:32:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:32:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:32:12,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187648403] [2022-04-08 08:32:12,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187648403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:12,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:12,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:32:12,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:32:12,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729196109] [2022-04-08 08:32:12,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729196109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:12,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:12,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:32:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486110257] [2022-04-08 08:32:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:32:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-08 08:32:12,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:32:12,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:32:12,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:12,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:32:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:32:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:32:12,975 INFO L87 Difference]: Start difference. First operand 1203 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:32:31,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:34,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:38,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:43,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:45,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:48,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:52,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:54,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:58,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:02,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:06,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:08,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 [] [2022-04-08 08:33:13,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:14,184 INFO L93 Difference]: Finished difference Result 2154 states and 3211 transitions. [2022-04-08 08:33:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:33:14,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-08 08:33:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:33:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-08 08:33:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:33:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-08 08:33:14,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1904 transitions. [2022-04-08 08:33:16,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1904 edges. 1904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:16,659 INFO L225 Difference]: With dead ends: 2154 [2022-04-08 08:33:16,659 INFO L226 Difference]: Without dead ends: 1486 [2022-04-08 08:33:16,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:33:16,664 INFO L913 BasicCegarLoop]: 761 mSDtfsCounter, 1797 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 741 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:33:16,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1856 Valid, 1170 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 1767 Invalid, 10 Unknown, 0 Unchecked, 33.3s Time] [2022-04-08 08:33:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-04-08 08:33:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1200. [2022-04-08 08:33:16,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:16,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:16,832 INFO L74 IsIncluded]: Start isIncluded. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:16,834 INFO L87 Difference]: Start difference. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:16,901 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-08 08:33:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-08 08:33:16,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:16,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:16,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-08 08:33:16,907 INFO L87 Difference]: Start difference. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-08 08:33:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:16,972 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-08 08:33:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-08 08:33:16,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:16,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:16,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:16,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 08:33:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1731 transitions. [2022-04-08 08:33:17,041 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1731 transitions. Word has length 53 [2022-04-08 08:33:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:17,041 INFO L478 AbstractCegarLoop]: Abstraction has 1200 states and 1731 transitions. [2022-04-08 08:33:17,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:33:17,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1200 states and 1731 transitions. [2022-04-08 08:33:19,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1731 transitions. [2022-04-08 08:33:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 08:33:19,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:19,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:33:19,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:33:19,996 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 1 times [2022-04-08 08:33:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:19,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122889366] [2022-04-08 08:33:20,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:33:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 2 times [2022-04-08 08:33:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559188918] [2022-04-08 08:33:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-08 08:33:20,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-08 08:33:20,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-08 08:33:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:33:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:33:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {77535#true} is VALID [2022-04-08 08:33:20,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-08 08:33:20,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:33:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 08:33:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:20,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,280 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-08 08:33:20,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:33:20,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:33:20,282 INFO L272 TraceCheckUtils]: 3: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:33:20,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,286 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,287 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-08 08:33:20,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {77535#true} call ULTIMATE.init(); {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:33:20,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {77535#true} call #t~ret1021 := main(); {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {77535#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 53); {77535#true} is VALID [2022-04-08 08:33:20,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-08 08:33:20,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 36); {77535#true} is VALID [2022-04-08 08:33:20,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-08 08:33:20,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 904); {77535#true} is VALID [2022-04-08 08:33:20,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {77535#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {77535#true} is VALID [2022-04-08 08:33:20,291 INFO L272 TraceCheckUtils]: 12: Hoare triple {77535#true} call _BLAST_init(); {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:33:20,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {77543#(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; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,293 INFO L272 TraceCheckUtils]: 18: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:33:20,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {77535#true} is VALID [2022-04-08 08:33:20,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-08 08:33:20,294 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:33:20,296 INFO L272 TraceCheckUtils]: 26: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:33:20,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-08 08:33:20,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:33:20,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:33:20,298 INFO L272 TraceCheckUtils]: 30: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:33:20,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:33:20,301 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:33:20,302 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {77536#false} assume -2147483648 <= #t~ret980 && #t~ret980 <= 2147483647;~status~15 := #t~ret980;havoc #t~ret980; {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {77536#false} assume 0 != ~we_should_unload~0; {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {77536#false} assume !(~s~0 == ~UNLOADED~0); {77536#false} is VALID [2022-04-08 08:33:20,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {77536#false} assume !(-1 == ~status~15); {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {77536#false} assume !(~s~0 != ~SKIP2~0); {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {77536#false} assume ~s~0 == ~DC~0; {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L272 TraceCheckUtils]: 51: Hoare triple {77536#false} call errorFn(); {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {77536#false} assume !false; {77536#false} is VALID [2022-04-08 08:33:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:33:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:20,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559188918] [2022-04-08 08:33:20,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559188918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:20,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:20,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:33:20,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:20,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122889366] [2022-04-08 08:33:20,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122889366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:20,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:20,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:33:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81609039] [2022-04-08 08:33:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-08 08:33:20,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:20,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:33:20,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:20,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:33:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:33:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:33:20,350 INFO L87 Difference]: Start difference. First operand 1200 states and 1731 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:33:44,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:54,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:56,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:58,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:00,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:08,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-08 08:34:12,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:14,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:19,227 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-08 08:34:22,108 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-08 08:34:33,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:40,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:49,386 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-08 08:34:59,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:01,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:03,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:08,006 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-08 08:35:18,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:20,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-08 08:35:27,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:29,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:33,134 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-08 08:35:38,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:45,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:50,366 INFO L93 Difference]: Finished difference Result 1832 states and 2719 transitions. [2022-04-08 08:35:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 08:35:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-08 08:35:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:35:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-08 08:35:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-08 08:35:50,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 1922 transitions. [2022-04-08 08:35:52,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1922 edges. 1922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:53,099 INFO L225 Difference]: With dead ends: 1832 [2022-04-08 08:35:53,100 INFO L226 Difference]: Without dead ends: 1772 [2022-04-08 08:35:53,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-04-08 08:35:53,102 INFO L913 BasicCegarLoop]: 1062 mSDtfsCounter, 2903 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 4440 mSolverCounterSat, 1366 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1366 IncrementalHoareTripleChecker+Valid, 4440 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:35:53,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2936 Valid, 2825 Invalid, 5821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1366 Valid, 4440 Invalid, 15 Unknown, 0 Unchecked, 66.3s Time] [2022-04-08 08:35:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-04-08 08:35:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1272. [2022-04-08 08:35:53,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:35:53,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:35:53,304 INFO L74 IsIncluded]: Start isIncluded. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:35:53,304 INFO L87 Difference]: Start difference. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:35:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:53,396 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-08 08:35:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-08 08:35:53,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:53,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:53,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-08 08:35:53,402 INFO L87 Difference]: Start difference. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-08 08:35:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:53,496 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-08 08:35:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-08 08:35:53,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:53,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:53,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:35:53,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:35:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 08:35:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1819 transitions. [2022-04-08 08:35:53,592 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1819 transitions. Word has length 53 [2022-04-08 08:35:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:35:53,592 INFO L478 AbstractCegarLoop]: Abstraction has 1272 states and 1819 transitions. [2022-04-08 08:35:53,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:53,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1272 states and 1819 transitions. [2022-04-08 08:35:56,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1819 transitions. [2022-04-08 08:35:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 08:35:56,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:35:56,978 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:35:56,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:35:56,979 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:35:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:35:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 1 times [2022-04-08 08:35:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:56,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705987768] [2022-04-08 08:35:56,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:35:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 2 times [2022-04-08 08:35:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:56,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792085054] [2022-04-08 08:35:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-08 08:35:57,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-08 08:35:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:35:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 08:35:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {87367#true} is VALID [2022-04-08 08:35:57,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-08 08:35:57,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:35:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 08:35:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:57,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-08 08:35:57,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-08 08:35:57,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-08 08:35:57,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-08 08:35:57,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-08 08:35:57,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,284 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-08 08:35:57,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-08 08:35:57,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L272 TraceCheckUtils]: 3: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-08 08:35:57,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,288 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {87367#true} call ULTIMATE.init(); {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {87367#true} call #t~ret1021 := main(); {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 53); {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 36); {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 904); {87367#true} is VALID [2022-04-08 08:35:57,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {87367#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {87367#true} is VALID [2022-04-08 08:35:57,292 INFO L272 TraceCheckUtils]: 12: Hoare triple {87367#true} call _BLAST_init(); {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:57,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} call stub_driver_init(); {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:57,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := ~compFptr~0.base + ~compFptr~0.offset; {87367#true} is VALID [2022-04-08 08:35:57,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-08 08:35:57,296 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !!(~status~15 >= 0); {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-08 08:35:57,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !(2 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-08 08:35:57,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume !(3 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-08 08:35:57,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume 4 == ~__BLAST_NONDET___0~0; {87380#(not (= ~SKIP2~0 ~DC~0))} is VALID [2022-04-08 08:35:57,298 INFO L272 TraceCheckUtils]: 26: Hoare triple {87380#(not (= ~SKIP2~0 ~DC~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:57,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-08 08:35:57,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-08 08:35:57,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {87367#true} is VALID [2022-04-08 08:35:57,299 INFO L272 TraceCheckUtils]: 30: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:35:57,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-08 08:35:57,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-08 08:35:57,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-08 08:35:57,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-08 08:35:57,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-08 08:35:57,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-08 08:35:57,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,301 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-08 08:35:57,302 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume -2147483648 <= #t~ret980 && #t~ret980 <= 2147483647;~status~15 := #t~ret980;havoc #t~ret980; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~15); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~SKIP2~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-08 08:35:57,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume ~s~0 == ~DC~0; {87368#false} is VALID [2022-04-08 08:35:57,305 INFO L272 TraceCheckUtils]: 53: Hoare triple {87368#false} call errorFn(); {87368#false} is VALID [2022-04-08 08:35:57,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {87368#false} assume !false; {87368#false} is VALID [2022-04-08 08:35:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:35:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:57,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792085054] [2022-04-08 08:35:57,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792085054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:57,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:35:57,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:57,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705987768] [2022-04-08 08:35:57,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705987768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:57,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:35:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304507308] [2022-04-08 08:35:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-04-08 08:35:57,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:57,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:35:57,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:57,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:35:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:35:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:35:57,362 INFO L87 Difference]: Start difference. First operand 1272 states and 1819 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:36:29,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:32,641 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 []