/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-fb4f59a-m [2022-04-28 08:22:28,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:22:28,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:22:28,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:22:28,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:22:28,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:22:28,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:22:28,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:22:28,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:22:28,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:22:28,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:22:28,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:22:28,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:22:28,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:22:28,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:22:28,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:22:28,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:22:28,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:22:28,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:22:28,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:22:28,968 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:22:28,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:22:28,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:22:28,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:22:28,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:22:28,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:22:28,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:22:28,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:22:28,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:22:28,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:22:28,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:22:28,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:22:28,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:22:28,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:22:28,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:22:28,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:22:28,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:22:28,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:22:28,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:22:28,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:22:28,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:22:28,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:22:28,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:22:28,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:22:28,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:22:28,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:22:28,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:22:28,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:22:28,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:22:28,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:22:28,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:22:28,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:28,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:22:28,994 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:22:28,995 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:22:28,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:22:28,995 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:22:28,995 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:22:29,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:22:29,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:22:29,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:22:29,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:22:29,184 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:22:29,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-28 08:22:29,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c492aacd1/b616226a052144aeaa9ac3f34e2718dd/FLAG3ffe46542 [2022-04-28 08:22:29,824 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:22:29,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-28 08:22:29,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c492aacd1/b616226a052144aeaa9ac3f34e2718dd/FLAG3ffe46542 [2022-04-28 08:22:30,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c492aacd1/b616226a052144aeaa9ac3f34e2718dd [2022-04-28 08:22:30,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:22:30,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:22:30,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:30,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:22:30,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:22:30,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:30" (1/1) ... [2022-04-28 08:22:30,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf828ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:30, skipping insertion in model container [2022-04-28 08:22:30,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:22:30" (1/1) ... [2022-04-28 08:22:30,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:22:30,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:22:30,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-28 08:22:31,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:31,205 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:22:31,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-28 08:22:31,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:22:31,503 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:22:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31 WrapperNode [2022-04-28 08:22:31,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:22:31,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:22:31,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:22:31,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:22:31,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:22:31,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:22:31,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:22:31,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:22:31,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (1/1) ... [2022-04-28 08:22:31,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:22:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:22:31,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:22:31,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:22:31,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-28 08:22:31,832 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-28 08:22:31,833 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-28 08:22:31,833 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-28 08:22:31,833 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-28 08:22:31,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-28 08:22:31,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-28 08:22:31,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-28 08:22:31,837 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-28 08:22:31,838 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-28 08:22:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-28 08:22:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-28 08:22:31,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-28 08:22:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-28 08:22:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-28 08:22:31,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-28 08:22:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-28 08:22:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:22:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-28 08:22:31,846 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:22:31,847 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-28 08:22:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-28 08:22:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-28 08:22:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-28 08:22:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-28 08:22:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-28 08:22:31,852 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-28 08:22:31,856 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-28 08:22:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 08:22:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:22:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:22:32,325 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:22:32,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:22:32,344 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:32,367 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:32,368 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:32,368 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:32,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:32,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:32,398 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:32,404 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:32,404 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:32,404 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:32,424 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:32,425 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:32,426 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:40,281 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 08:22:40,281 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 08:22:40,297 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:40,303 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:40,303 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:40,304 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:40,311 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:40,311 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:40,312 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:40,324 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:40,324 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:40,324 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:40,341 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:40,341 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:40,343 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,455 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:22:43,455 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:22:43,522 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,649 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-28 08:22:43,649 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-28 08:22:43,655 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,665 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:43,665 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:43,666 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,691 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-28 08:22:43,691 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-28 08:22:43,691 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,696 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:43,696 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:43,696 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,702 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:43,703 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:43,721 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,728 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:43,729 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:43,730 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:43,734 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:43,735 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:44,076 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:45,595 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:22:45,595 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:22:45,602 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:48,816 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-28 08:22:48,816 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-28 08:22:48,824 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:48,841 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-28 08:22:48,841 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-28 08:22:48,858 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:48,862 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:48,863 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:48,937 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:49,029 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2022-04-28 08:22:49,029 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2022-04-28 08:22:49,078 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:49,082 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:49,083 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:49,133 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:49,137 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:49,137 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:49,137 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,326 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-28 08:22:52,326 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-28 08:22:52,330 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,351 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-28 08:22:52,351 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-28 08:22:52,361 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,370 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-28 08:22:52,371 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-28 08:22:52,381 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,386 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:52,386 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:52,617 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-28 08:22:52,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-28 08:22:52,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-28 08:22:52,663 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:52,668 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-28 08:22:52,669 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-28 08:22:52,727 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:22:58,956 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-28 08:22:58,956 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-28 08:22:59,008 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:22:59,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:22:59,021 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-28 08:22:59,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:22:59 BoogieIcfgContainer [2022-04-28 08:22:59,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:22:59,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:22:59,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:22:59,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:22:59,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:22:30" (1/3) ... [2022-04-28 08:22:59,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5714a272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:22:59, skipping insertion in model container [2022-04-28 08:22:59,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:22:31" (2/3) ... [2022-04-28 08:22:59,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5714a272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:22:59, skipping insertion in model container [2022-04-28 08:22:59,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:22:59" (3/3) ... [2022-04-28 08:22:59,031 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2022-04-28 08:22:59,042 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:22:59,042 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:22:59,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:22:59,106 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6927b2a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76dba6af [2022-04-28 08:22:59,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:22:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-28 08:22:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:22:59,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:59,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:22:59,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 1 times [2022-04-28 08:22:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:59,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941886949] [2022-04-28 08:22:59,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 2 times [2022-04-28 08:22:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:59,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32604859] [2022-04-28 08:22:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:59,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-28 08:22:59,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 08:22:59,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-28 08:22:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:22:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:59,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:22:59,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-28 08:22:59,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 08:22:59,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-28 08:22:59,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret1021 := main(); {1264#true} is VALID [2022-04-28 08:22:59,700 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-28 08:22:59,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 53); {1264#true} is VALID [2022-04-28 08:22:59,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-28 08:22:59,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 36); {1264#true} is VALID [2022-04-28 08:22:59,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-28 08:22:59,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 904); {1264#true} is VALID [2022-04-28 08:22:59,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1264#true} is VALID [2022-04-28 08:22:59,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {1264#true} call _BLAST_init(); {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:22:59,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,704 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#false} assume !(-1 == ~status~15); {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#false} assume !(~s~0 != ~SKIP2~0); {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {1265#false} assume !(1 == ~pended~0); {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {1265#false} assume ~s~0 == ~DC~0; {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#false} call errorFn(); {1265#false} is VALID [2022-04-28 08:22:59,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-28 08:22:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:22:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32604859] [2022-04-28 08:22:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32604859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:59,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:22:59,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:59,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941886949] [2022-04-28 08:22:59,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941886949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:59,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:59,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:22:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496003564] [2022-04-28 08:22:59,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:59,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-28 08:22:59,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:59,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:22:59,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:59,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:22:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:22:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:22:59,773 INFO L87 Difference]: Start difference. First operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:23:12,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:16,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:23,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:28,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:32,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:34,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:36,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:38,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:45,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:47,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:49,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:23:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:50,464 INFO L93 Difference]: Finished difference Result 1537 states and 2438 transitions. [2022-04-28 08:23:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:23:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-28 08:23:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:23:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-28 08:23:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:23:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-28 08:23:50,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2438 transitions. [2022-04-28 08:23:53,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2438 edges. 2438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:23:53,218 INFO L225 Difference]: With dead ends: 1537 [2022-04-28 08:23:53,219 INFO L226 Difference]: Without dead ends: 842 [2022-04-28 08:23:53,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:23:53,232 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 484 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 187 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:23:53,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1302 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1966 Invalid, 10 Unknown, 0 Unchecked, 27.5s Time] [2022-04-28 08:23:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-28 08:23:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 679. [2022-04-28 08:23:53,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:53,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 08:23:53,346 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 08:23:53,348 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 08:23:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:53,394 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-28 08:23:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-28 08:23:53,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:53,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:53,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-28 08:23:53,408 INFO L87 Difference]: Start difference. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-28 08:23:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:53,446 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-28 08:23:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-28 08:23:53,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:23:53,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:23:53,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:23:53,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:23:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 08:23:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 991 transitions. [2022-04-28 08:23:53,480 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 991 transitions. Word has length 26 [2022-04-28 08:23:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:23:53,480 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 991 transitions. [2022-04-28 08:23:53,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:23:53,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 991 transitions. [2022-04-28 08:23:54,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:23:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 991 transitions. [2022-04-28 08:23:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:23:54,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:23:54,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:23:54,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:23:54,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:23:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:23:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 1 times [2022-04-28 08:23:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:54,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714018570] [2022-04-28 08:23:54,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:23:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 2 times [2022-04-28 08:23:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:23:54,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115235223] [2022-04-28 08:23:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:23:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:23:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:23:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:54,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 08:23:54,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-28 08:23:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:23:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:54,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 08:23:54,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-28 08:23:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:23:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:23:54,782 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-28 08:23:54,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {7398#true} call ULTIMATE.init(); {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:23:54,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 08:23:54,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-28 08:23:54,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#true} call #t~ret1021 := main(); {7398#true} is VALID [2022-04-28 08:23:54,785 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-28 08:23:54,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 53); {7398#true} is VALID [2022-04-28 08:23:54,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 36); {7398#true} is VALID [2022-04-28 08:23:54,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 904); {7398#true} is VALID [2022-04-28 08:23:54,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7398#true} is VALID [2022-04-28 08:23:54,791 INFO L272 TraceCheckUtils]: 12: Hoare triple {7398#true} call _BLAST_init(); {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:23:54,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-28 08:23:54,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-28 08:23:54,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-28 08:23:54,792 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-28 08:23:54,792 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-28 08:23:54,792 INFO L272 TraceCheckUtils]: 18: Hoare triple {7398#true} call stub_driver_init(); {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:23:54,793 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-28 08:23:54,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,793 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {7409#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,795 INFO L272 TraceCheckUtils]: 26: Hoare triple {7409#(= ~s~0 ~NP~0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:23:54,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7399#false} is VALID [2022-04-28 08:23:54,796 INFO L272 TraceCheckUtils]: 29: Hoare triple {7399#false} call errorFn(); {7399#false} is VALID [2022-04-28 08:23:54,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-04-28 08:23:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:23:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:23:54,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115235223] [2022-04-28 08:23:54,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115235223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:54,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:54,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:23:54,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:23:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714018570] [2022-04-28 08:23:54,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714018570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:23:54,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:23:54,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:23:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900150563] [2022-04-28 08:23:54,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:23:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-28 08:23:54,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:23:54,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:23:54,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:23:54,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:23:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:23:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:23:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:23:54,829 INFO L87 Difference]: Start difference. First operand 679 states and 991 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:24:09,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:23,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:25,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:27,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-28 08:24:34,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:36,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:24:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:40,555 INFO L93 Difference]: Finished difference Result 1457 states and 2151 transitions. [2022-04-28 08:24:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:24:40,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-28 08:24:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:24:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:24:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-28 08:24:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:24:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-28 08:24:40,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2151 transitions. [2022-04-28 08:24:42,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2151 edges. 2151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:42,860 INFO L225 Difference]: With dead ends: 1457 [2022-04-28 08:24:42,860 INFO L226 Difference]: Without dead ends: 1180 [2022-04-28 08:24:42,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:24:42,861 INFO L413 NwaCegarLoop]: 1209 mSDtfsCounter, 1465 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 360 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:24:42,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1931 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2661 Invalid, 5 Unknown, 0 Unchecked, 19.1s Time] [2022-04-28 08:24:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-04-28 08:24:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 991. [2022-04-28 08:24:42,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:24:42,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-28 08:24:42,931 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-28 08:24:42,933 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-28 08:24:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:42,979 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-28 08:24:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-28 08:24:42,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:42,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:42,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-28 08:24:42,986 INFO L87 Difference]: Start difference. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-28 08:24:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:43,033 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-28 08:24:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-28 08:24:43,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:43,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:43,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:24:43,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:24:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-28 08:24:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1448 transitions. [2022-04-28 08:24:43,095 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1448 transitions. Word has length 31 [2022-04-28 08:24:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:24:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1448 transitions. [2022-04-28 08:24:43,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:24:43,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1448 transitions. [2022-04-28 08:24:44,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1448 transitions. [2022-04-28 08:24:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 08:24:44,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:44,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:24:44,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:24:44,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 1 times [2022-04-28 08:24:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:44,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608220486] [2022-04-28 08:24:44,783 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 2 times [2022-04-28 08:24:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:44,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940196195] [2022-04-28 08:24:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:44,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-28 08:24:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:24:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:44,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-28 08:24:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:24:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:44,974 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-28 08:24:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-28 08:24:44,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {14677#true} call ULTIMATE.init(); {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:24:44,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-28 08:24:44,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {14677#true} call #t~ret1021 := main(); {14677#true} is VALID [2022-04-28 08:24:44,976 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-28 08:24:44,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 53); {14677#true} is VALID [2022-04-28 08:24:44,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 36); {14677#true} is VALID [2022-04-28 08:24:44,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 904); {14677#true} is VALID [2022-04-28 08:24:44,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {14677#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14677#true} is VALID [2022-04-28 08:24:44,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {14677#true} call _BLAST_init(); {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:24:44,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-28 08:24:44,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-28 08:24:44,978 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-28 08:24:44,978 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-28 08:24:44,979 INFO L272 TraceCheckUtils]: 18: Hoare triple {14677#true} call stub_driver_init(); {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:24:44,980 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-28 08:24:44,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-28 08:24:44,981 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-28 08:24:44,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {14677#true} assume !!(~status~15 >= 0); {14677#true} is VALID [2022-04-28 08:24:44,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {14677#true} assume !(2 == ~__BLAST_NONDET___0~0); {14677#true} is VALID [2022-04-28 08:24:44,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {14677#true} assume 3 == ~__BLAST_NONDET___0~0; {14677#true} is VALID [2022-04-28 08:24:44,981 INFO L272 TraceCheckUtils]: 25: Hoare triple {14677#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14677#true} is VALID [2022-04-28 08:24:44,981 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-28 08:24:44,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {14677#true} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-28 08:24:44,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {14677#true} assume 22 == #t~mem131 % 256;havoc #t~mem131; {14677#true} is VALID [2022-04-28 08:24:44,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#true} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14677#true} is VALID [2022-04-28 08:24:44,984 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-28 08:24:44,984 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-28 08:24:44,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {14677#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {14677#true} is VALID [2022-04-28 08:24:44,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {14677#true} assume !(~s~0 == ~MPR3~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:24:44,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:24:44,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14678#false} is VALID [2022-04-28 08:24:44,993 INFO L272 TraceCheckUtils]: 36: Hoare triple {14678#false} call errorFn(); {14678#false} is VALID [2022-04-28 08:24:44,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {14678#false} assume !false; {14678#false} is VALID [2022-04-28 08:24:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:24:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940196195] [2022-04-28 08:24:44,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940196195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:44,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:44,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:24:44,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:44,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608220486] [2022-04-28 08:24:44,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608220486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:44,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:44,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:24:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446439505] [2022-04-28 08:24:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-28 08:24:44,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:44,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:24:45,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:45,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:24:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:24:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:24:45,020 INFO L87 Difference]: Start difference. First operand 991 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:25:00,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:05,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:07,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:11,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:13,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:17,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:22,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:24,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-28 08:25:28,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:30,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:37,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:40,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:48,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:50,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:53,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:25:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:56,994 INFO L93 Difference]: Finished difference Result 2293 states and 3447 transitions. [2022-04-28 08:25:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:25:56,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-28 08:25:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:25:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:25:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-28 08:25:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:25:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-28 08:25:57,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2367 transitions. [2022-04-28 08:25:59,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2367 edges. 2367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:25:59,830 INFO L225 Difference]: With dead ends: 2293 [2022-04-28 08:25:59,830 INFO L226 Difference]: Without dead ends: 1837 [2022-04-28 08:25:59,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:25:59,832 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 1581 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 517 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:25:59,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 2171 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2325 Invalid, 12 Unknown, 0 Unchecked, 38.9s Time] [2022-04-28 08:25:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-04-28 08:25:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1172. [2022-04-28 08:25:59,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:25:59,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-28 08:25:59,927 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-28 08:25:59,929 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-28 08:26:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:00,028 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-28 08:26:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-28 08:26:00,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:00,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:00,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-28 08:26:00,037 INFO L87 Difference]: Start difference. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-28 08:26:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:00,149 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-28 08:26:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-28 08:26:00,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:00,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:00,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:26:00,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:26:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-28 08:26:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1733 transitions. [2022-04-28 08:26:00,235 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1733 transitions. Word has length 38 [2022-04-28 08:26:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:26:00,236 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1733 transitions. [2022-04-28 08:26:00,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:26:00,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1172 states and 1733 transitions. [2022-04-28 08:26:02,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1733 transitions. [2022-04-28 08:26:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:26:02,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:26:02,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:26:02,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:26:02,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:26:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:26:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 1 times [2022-04-28 08:26:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701541445] [2022-04-28 08:26:02,514 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:26:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 2 times [2022-04-28 08:26:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:26:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487331695] [2022-04-28 08:26:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:26:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:26:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:26:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:02,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-28 08:26:02,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-28 08:26:02,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-28 08:26:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:26:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:02,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:26:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:02,728 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-28 08:26:02,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:26:02,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {25303#true} call ULTIMATE.init(); {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:26:02,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-28 08:26:02,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-28 08:26:02,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-28 08:26:02,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {25303#true} call #t~ret1021 := main(); {25303#true} is VALID [2022-04-28 08:26:02,730 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-28 08:26:02,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 53); {25303#true} is VALID [2022-04-28 08:26:02,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-28 08:26:02,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 36); {25303#true} is VALID [2022-04-28 08:26:02,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-28 08:26:02,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 904); {25303#true} is VALID [2022-04-28 08:26:02,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {25303#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {25303#true} is VALID [2022-04-28 08:26:02,732 INFO L272 TraceCheckUtils]: 12: Hoare triple {25303#true} call _BLAST_init(); {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:26:02,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-28 08:26:02,733 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-28 08:26:02,733 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-28 08:26:02,734 INFO L272 TraceCheckUtils]: 18: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:26:02,734 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-28 08:26:02,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-28 08:26:02,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,736 INFO L272 TraceCheckUtils]: 25: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,737 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-28 08:26:02,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem131 % 256;havoc #t~mem131; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,738 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-28 08:26:02,739 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-28 08:26:02,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 08:26:02,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {25304#false} assume !(1 == ~setEventCalled~0); {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {25304#false} assume !(1 == ~customIrp~0); {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {25304#false} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L272 TraceCheckUtils]: 37: Hoare triple {25304#false} call errorFn(); {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {25304#false} assume !false; {25304#false} is VALID [2022-04-28 08:26:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:26:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:26:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487331695] [2022-04-28 08:26:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487331695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:02,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:26:02,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:26:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701541445] [2022-04-28 08:26:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701541445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:02,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:26:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297790147] [2022-04-28 08:26:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:26:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-28 08:26:02,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:26:02,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:26:02,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:02,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 08:26:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 08:26:02,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:26:02,769 INFO L87 Difference]: Start difference. First operand 1172 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:26:24,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:29,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:33,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:35,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:37,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-28 08:26:40,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:42,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:49,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:51,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:26:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:52,306 INFO L93 Difference]: Finished difference Result 2221 states and 3345 transitions. [2022-04-28 08:26:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:26:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-28 08:26:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:26:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:26:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-28 08:26:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:26:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-28 08:26:52,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2779 transitions. [2022-04-28 08:26:55,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2779 edges. 2779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:55,384 INFO L225 Difference]: With dead ends: 2221 [2022-04-28 08:26:55,385 INFO L226 Difference]: Without dead ends: 1514 [2022-04-28 08:26:55,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-28 08:26:55,387 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 3783 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 1394 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3814 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1394 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:26:55,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3814 Valid, 2589 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1394 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 22.6s Time] [2022-04-28 08:26:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-04-28 08:26:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1166. [2022-04-28 08:26:55,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:26:55,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-28 08:26:55,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-28 08:26:55,508 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-28 08:26:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:55,572 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-28 08:26:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-28 08:26:55,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:55,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:55,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-28 08:26:55,579 INFO L87 Difference]: Start difference. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-28 08:26:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:26:55,644 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-28 08:26:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-28 08:26:55,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:26:55,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:26:55,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:26:55,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:26:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-28 08:26:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1721 transitions. [2022-04-28 08:26:55,714 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1721 transitions. Word has length 39 [2022-04-28 08:26:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:26:55,714 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1721 transitions. [2022-04-28 08:26:55,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:26:55,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1166 states and 1721 transitions. [2022-04-28 08:26:58,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1721 transitions. [2022-04-28 08:26:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 08:26:58,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:26:58,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:26:58,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:26:58,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:26:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:26:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 1 times [2022-04-28 08:26:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:58,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360191231] [2022-04-28 08:26:58,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:26:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 2 times [2022-04-28 08:26:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:26:58,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29103587] [2022-04-28 08:26:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:26:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:26:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:26:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:58,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 08:26:58,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-28 08:26:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:26:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:58,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 08:26:58,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-28 08:26:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:26:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:26:58,424 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-28 08:26:58,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {35141#true} call ULTIMATE.init(); {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:26:58,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {35141#true} call #t~ret1021 := main(); {35141#true} is VALID [2022-04-28 08:26:58,427 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-28 08:26:58,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 53); {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 36); {35141#true} is VALID [2022-04-28 08:26:58,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 904); {35141#true} is VALID [2022-04-28 08:26:58,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {35141#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {35141#true} is VALID [2022-04-28 08:26:58,429 INFO L272 TraceCheckUtils]: 12: Hoare triple {35141#true} call _BLAST_init(); {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:26:58,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-28 08:26:58,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-28 08:26:58,429 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-28 08:26:58,429 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-28 08:26:58,429 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-28 08:26:58,430 INFO L272 TraceCheckUtils]: 18: Hoare triple {35141#true} call stub_driver_init(); {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:26:58,430 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-28 08:26:58,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,433 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {35152#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {35152#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,435 INFO L272 TraceCheckUtils]: 26: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {35152#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,436 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-28 08:26:58,437 INFO L272 TraceCheckUtils]: 30: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-28 08:26:58,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {35152#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {35142#false} is VALID [2022-04-28 08:26:58,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {35142#false} assume 0 == ~routine~0; {35142#false} is VALID [2022-04-28 08:26:58,437 INFO L272 TraceCheckUtils]: 34: Hoare triple {35142#false} call #t~ret1012 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {35142#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {35142#false} assume 0 != ~myIrp_PendingReturned~0; {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {35142#false} assume !(0 == ~pended~0); {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L272 TraceCheckUtils]: 38: Hoare triple {35142#false} call errorFn(); {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {35142#false} assume !false; {35142#false} is VALID [2022-04-28 08:26:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:26:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:26:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29103587] [2022-04-28 08:26:58,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29103587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:58,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:58,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:26:58,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:26:58,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360191231] [2022-04-28 08:26:58,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360191231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:26:58,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:26:58,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:26:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865082638] [2022-04-28 08:26:58,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:26:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-28 08:26:58,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:26:58,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:26:58,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:58,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:26:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:26:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:26:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:26:58,482 INFO L87 Difference]: Start difference. First operand 1166 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:27:15,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:17,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:21,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:23,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:29,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:31,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:39,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:50,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:54,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:27:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:58,387 INFO L93 Difference]: Finished difference Result 2067 states and 3010 transitions. [2022-04-28 08:27:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:27:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-28 08:27:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:27:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:27:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-28 08:27:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:27:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-28 08:27:58,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1796 transitions. [2022-04-28 08:28:00,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1796 edges. 1796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:28:00,521 INFO L225 Difference]: With dead ends: 2067 [2022-04-28 08:28:00,521 INFO L226 Difference]: Without dead ends: 1899 [2022-04-28 08:28:00,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:28:00,524 INFO L413 NwaCegarLoop]: 1132 mSDtfsCounter, 1444 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 334 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:28:00,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1826 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1522 Invalid, 7 Unknown, 0 Unchecked, 24.0s Time] [2022-04-28 08:28:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-28 08:28:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1631. [2022-04-28 08:28:00,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:28:00,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:28:00,661 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:28:00,662 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:28:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:00,765 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-28 08:28:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-28 08:28:00,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:00,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:00,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-28 08:28:00,775 INFO L87 Difference]: Start difference. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-28 08:28:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:28:00,878 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-28 08:28:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-28 08:28:00,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:28:00,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:28:00,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:28:00,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:28:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:28:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2392 transitions. [2022-04-28 08:28:01,031 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2392 transitions. Word has length 40 [2022-04-28 08:28:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:28:01,032 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2392 transitions. [2022-04-28 08:28:01,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:28:01,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1631 states and 2392 transitions. [2022-04-28 08:28:04,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2392 edges. 2392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:28:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2392 transitions. [2022-04-28 08:28:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 08:28:04,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:28:04,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:28:04,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:28:04,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:28:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:28:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 1 times [2022-04-28 08:28:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:28:04,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420971654] [2022-04-28 08:28:04,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:28:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 2 times [2022-04-28 08:28:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:28:04,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198093084] [2022-04-28 08:28:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:28:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:28:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:28:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:04,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-28 08:28:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:28:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:04,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-28 08:28:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:28:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:28:04,508 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-28 08:28:04,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {46358#true} call ULTIMATE.init(); {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:28:04,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {46358#true} call #t~ret1021 := main(); {46358#true} is VALID [2022-04-28 08:28:04,510 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-28 08:28:04,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 53); {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 36); {46358#true} is VALID [2022-04-28 08:28:04,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 904); {46358#true} is VALID [2022-04-28 08:28:04,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {46358#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {46358#true} is VALID [2022-04-28 08:28:04,512 INFO L272 TraceCheckUtils]: 12: Hoare triple {46358#true} call _BLAST_init(); {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:28:04,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-28 08:28:04,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,512 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-28 08:28:04,512 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-28 08:28:04,512 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-28 08:28:04,513 INFO L272 TraceCheckUtils]: 18: Hoare triple {46358#true} call stub_driver_init(); {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:28:04,513 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-28 08:28:04,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {46358#true} assume !!(~status~15 >= 0); {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {46358#true} assume !(2 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {46358#true} assume !(3 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {46358#true} assume 4 == ~__BLAST_NONDET___0~0; {46358#true} is VALID [2022-04-28 08:28:04,513 INFO L272 TraceCheckUtils]: 26: Hoare triple {46358#true} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {46358#true} is VALID [2022-04-28 08:28:04,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {46358#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {46358#true} is VALID [2022-04-28 08:28:04,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {46358#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,515 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-28 08:28:04,519 INFO L272 TraceCheckUtils]: 30: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:28:04,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {46359#false} is VALID [2022-04-28 08:28:04,522 INFO L272 TraceCheckUtils]: 38: Hoare triple {46359#false} call errorFn(); {46359#false} is VALID [2022-04-28 08:28:04,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {46359#false} assume !false; {46359#false} is VALID [2022-04-28 08:28:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:28:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:28:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198093084] [2022-04-28 08:28:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198093084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:28:04,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:28:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:28:04,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:28:04,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420971654] [2022-04-28 08:28:04,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420971654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:28:04,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:28:04,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:28:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135472562] [2022-04-28 08:28:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:28:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-28 08:28:04,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:28:04,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:28:04,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:28:04,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:28:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:28:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:28:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:28:04,550 INFO L87 Difference]: Start difference. First operand 1631 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:28:16,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:21,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:27,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:29,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:32,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:35,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:37,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:40,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:46,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:48,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:50,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:28:55,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:00,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:02,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:06,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:09,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:13,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:13,761 INFO L93 Difference]: Finished difference Result 1768 states and 2618 transitions. [2022-04-28 08:29:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:29:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-28 08:29:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:29:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:29:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-28 08:29:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:29:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-28 08:29:13,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1234 transitions. [2022-04-28 08:29:15,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:15,429 INFO L225 Difference]: With dead ends: 1768 [2022-04-28 08:29:15,429 INFO L226 Difference]: Without dead ends: 1764 [2022-04-28 08:29:15,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:29:15,432 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 939 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 360 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:29:15,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1479 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1627 Invalid, 14 Unknown, 0 Unchecked, 39.6s Time] [2022-04-28 08:29:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-28 08:29:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1630. [2022-04-28 08:29:15,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:29:15,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:29:15,574 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:29:15,576 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:29:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:15,666 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-28 08:29:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-28 08:29:15,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:29:15,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:29:15,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-28 08:29:15,674 INFO L87 Difference]: Start difference. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-28 08:29:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:29:15,764 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-28 08:29:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-28 08:29:15,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:29:15,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:29:15,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:29:15,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:29:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-28 08:29:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2389 transitions. [2022-04-28 08:29:15,926 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2389 transitions. Word has length 40 [2022-04-28 08:29:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:29:15,927 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2389 transitions. [2022-04-28 08:29:15,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 08:29:15,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1630 states and 2389 transitions. [2022-04-28 08:29:19,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2389 edges. 2389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2389 transitions. [2022-04-28 08:29:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 08:29:19,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:29:19,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:29:19,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:29:19,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:29:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:29:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 1 times [2022-04-28 08:29:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855812655] [2022-04-28 08:29:19,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:29:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 2 times [2022-04-28 08:29:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:29:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229231634] [2022-04-28 08:29:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:29:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:29:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:29:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:19,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-28 08:29:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:29:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:19,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-28 08:29:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:29:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:19,491 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-28 08:29:19,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-28 08:29:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 08:29:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:19,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-28 08:29:19,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-28 08:29:19,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-28 08:29:19,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-28 08:29:19,509 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-28 08:29:19,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {56704#true} call ULTIMATE.init(); {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:29:19,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-28 08:29:19,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {56704#true} call #t~ret1021 := main(); {56704#true} is VALID [2022-04-28 08:29:19,510 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-28 08:29:19,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 53); {56704#true} is VALID [2022-04-28 08:29:19,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 36); {56704#true} is VALID [2022-04-28 08:29:19,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 904); {56704#true} is VALID [2022-04-28 08:29:19,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {56704#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56704#true} is VALID [2022-04-28 08:29:19,512 INFO L272 TraceCheckUtils]: 12: Hoare triple {56704#true} call _BLAST_init(); {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:29:19,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-28 08:29:19,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,512 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-28 08:29:19,512 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-28 08:29:19,512 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-28 08:29:19,513 INFO L272 TraceCheckUtils]: 18: Hoare triple {56704#true} call stub_driver_init(); {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:29:19,513 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-28 08:29:19,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-28 08:29:19,513 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-28 08:29:19,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {56704#true} assume !!(~status~15 >= 0); {56704#true} is VALID [2022-04-28 08:29:19,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {56704#true} assume !(2 == ~__BLAST_NONDET___0~0); {56704#true} is VALID [2022-04-28 08:29:19,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {56704#true} assume 3 == ~__BLAST_NONDET___0~0; {56704#true} is VALID [2022-04-28 08:29:19,513 INFO L272 TraceCheckUtils]: 25: Hoare triple {56704#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56704#true} is VALID [2022-04-28 08:29:19,513 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-28 08:29:19,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {56704#true} assume 0 == #t~mem130 % 256;havoc #t~mem130; {56704#true} is VALID [2022-04-28 08:29:19,514 INFO L272 TraceCheckUtils]: 28: Hoare triple {56704#true} call #t~ret132 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-28 08:29:19,514 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-28 08:29:19,514 INFO L272 TraceCheckUtils]: 30: Hoare triple {56704#true} call #t~ret65 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-28 08:29:19,514 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-28 08:29:19,515 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-28 08:29:19,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {56704#true} havoc #t~memcpy~res948.base, #t~memcpy~res948.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56704#true} is VALID [2022-04-28 08:29:19,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {56704#true} assume !(~s~0 != ~NP~0); {56704#true} is VALID [2022-04-28 08:29:19,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {56704#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 08:29:19,516 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-28 08:29:19,520 INFO L272 TraceCheckUtils]: 42: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~ret953 := IofCallDriver(#t~mem952.base, #t~mem952.offset, ~Irp.base, ~Irp.offset); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 08:29:19,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-28 08:29:19,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56721#(not (= ~routine~0 0))} is VALID [2022-04-28 08:29:19,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {56721#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56705#false} is VALID [2022-04-28 08:29:19,521 INFO L272 TraceCheckUtils]: 46: Hoare triple {56705#false} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56705#false} is VALID [2022-04-28 08:29:19,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {56705#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56705#false} is VALID [2022-04-28 08:29:19,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {56705#false} assume 0 != ~myIrp_PendingReturned~0; {56705#false} is VALID [2022-04-28 08:29:19,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {56705#false} assume !(0 == ~pended~0); {56705#false} is VALID [2022-04-28 08:29:19,526 INFO L272 TraceCheckUtils]: 50: Hoare triple {56705#false} call errorFn(); {56705#false} is VALID [2022-04-28 08:29:19,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {56705#false} assume !false; {56705#false} is VALID [2022-04-28 08:29:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:29:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:29:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229231634] [2022-04-28 08:29:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229231634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:19,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:29:19,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:29:19,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855812655] [2022-04-28 08:29:19,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855812655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:19,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:19,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 08:29:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894835378] [2022-04-28 08:29:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:29:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-28 08:29:19,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:29:19,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 08:29:19,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:19,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 08:29:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 08:29:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:29:19,569 INFO L87 Difference]: Start difference. First operand 1630 states and 2389 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 08:29:34,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:46,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:48,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:50,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:57,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:29:59,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:09,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:10,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:15,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:19,508 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-28 08:30:26,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:29,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:31,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:33,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:43,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:45,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:50,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:52,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:30:58,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:00,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:05,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:07,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-28 08:31:11,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:14,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:16,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:19,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:20,694 INFO L93 Difference]: Finished difference Result 2734 states and 4044 transitions. [2022-04-28 08:31:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 08:31:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-28 08:31:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:31:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 08:31:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-28 08:31:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 08:31:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-28 08:31:20,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 2103 transitions. [2022-04-28 08:31:23,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:23,323 INFO L225 Difference]: With dead ends: 2734 [2022-04-28 08:31:23,324 INFO L226 Difference]: Without dead ends: 1596 [2022-04-28 08:31:23,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-28 08:31:23,326 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 2060 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 1015 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:31:23,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1659 Invalid, 4278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3244 Invalid, 19 Unknown, 0 Unchecked, 68.3s Time] [2022-04-28 08:31:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-28 08:31:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1203. [2022-04-28 08:31:23,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:31:23,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:31:23,472 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:31:23,473 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:31:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:23,549 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-28 08:31:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-28 08:31:23,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:23,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:23,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-28 08:31:23,556 INFO L87 Difference]: Start difference. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-28 08:31:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:31:23,632 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-28 08:31:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-28 08:31:23,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:31:23,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:31:23,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:31:23,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:31:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:31:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1742 transitions. [2022-04-28 08:31:23,704 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1742 transitions. Word has length 52 [2022-04-28 08:31:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:31:23,705 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1742 transitions. [2022-04-28 08:31:23,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 08:31:23,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1203 states and 1742 transitions. [2022-04-28 08:31:26,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1742 edges. 1742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1742 transitions. [2022-04-28 08:31:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 08:31:26,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:31:26,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:31:26,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:31:26,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:31:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:31:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 1 times [2022-04-28 08:31:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:26,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940803681] [2022-04-28 08:31:26,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:31:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 2 times [2022-04-28 08:31:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:31:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262112507] [2022-04-28 08:31:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:31:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:31:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:31:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:26,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:31:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:26,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-28 08:31:26,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 08:31:26,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:31:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:26,820 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-28 08:31:26,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 08:31:26,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 08:31:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:31:26,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-28 08:31:26,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-28 08:31:26,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-28 08:31:26,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-28 08:31:26,840 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {67819#true} call ULTIMATE.init(); {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:31:26,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1021 := main(); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,842 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-28 08:31:26,843 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-28 08:31:26,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,843 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-28 08:31:26,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,844 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-28 08:31:26,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,845 INFO L272 TraceCheckUtils]: 12: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:31:26,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-28 08:31:26,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 08:31:26,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,846 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-28 08:31:26,846 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-28 08:31:26,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:31:26,847 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-28 08:31:26,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-28 08:31:26,848 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret978 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,853 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-28 08:31:26,853 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-28 08:31:26,854 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-28 08:31:26,854 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-28 08:31:26,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem163 % 256;havoc #t~mem163; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,856 INFO L272 TraceCheckUtils]: 30: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret167 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,856 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-28 08:31:26,856 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-28 08:31:26,857 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-28 08:31:26,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-28 08:31:26,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-28 08:31:26,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-28 08:31:26,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-28 08:31:26,860 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc #t~memcpy~res938.base, #t~memcpy~res938.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,861 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-28 08:31:26,862 INFO L272 TraceCheckUtils]: 43: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret943 := IofCallDriver(#t~mem942.base, #t~mem942.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,863 INFO L272 TraceCheckUtils]: 47: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-28 08:31:26,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67820#false} is VALID [2022-04-28 08:31:26,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {67820#false} assume !(0 == ~pended~0); {67820#false} is VALID [2022-04-28 08:31:26,864 INFO L272 TraceCheckUtils]: 51: Hoare triple {67820#false} call errorFn(); {67820#false} is VALID [2022-04-28 08:31:26,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {67820#false} assume !false; {67820#false} is VALID [2022-04-28 08:31:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:31:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:31:26,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262112507] [2022-04-28 08:31:26,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262112507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:26,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:26,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 08:31:26,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:31:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940803681] [2022-04-28 08:31:26,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940803681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:31:26,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:31:26,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 08:31:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194685914] [2022-04-28 08:31:26,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:31:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-28 08:31:26,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:31:26,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:31:26,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:31:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 08:31:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:31:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 08:31:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:31:26,907 INFO L87 Difference]: Start difference. First operand 1203 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:31:42,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:49,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:52,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:31:56,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:01,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:03,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:05,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:08,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:10,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:18,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:23,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:25,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:29,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:33,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:38,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:40,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:44,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:32:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:45,471 INFO L93 Difference]: Finished difference Result 2154 states and 3211 transitions. [2022-04-28 08:32:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 08:32:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-28 08:32:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:32:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:32:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-28 08:32:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:32:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-28 08:32:45,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1904 transitions. [2022-04-28 08:32:47,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1904 edges. 1904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:47,895 INFO L225 Difference]: With dead ends: 2154 [2022-04-28 08:32:47,896 INFO L226 Difference]: Without dead ends: 1486 [2022-04-28 08:32:47,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-28 08:32:47,897 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 1797 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 741 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:32:47,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1170 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 1773 Invalid, 10 Unknown, 0 Unchecked, 40.6s Time] [2022-04-28 08:32:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-04-28 08:32:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1200. [2022-04-28 08:32:48,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:32:48,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:32:48,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:32:48,057 INFO L87 Difference]: Start difference. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:32:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:48,121 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-28 08:32:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-28 08:32:48,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:48,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:48,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-28 08:32:48,127 INFO L87 Difference]: Start difference. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-28 08:32:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:32:48,191 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-28 08:32:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-28 08:32:48,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:32:48,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:32:48,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:32:48,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:32:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-28 08:32:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1731 transitions. [2022-04-28 08:32:48,263 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1731 transitions. Word has length 53 [2022-04-28 08:32:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:32:48,263 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1731 transitions. [2022-04-28 08:32:48,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:32:48,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1200 states and 1731 transitions. [2022-04-28 08:32:51,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1731 transitions. [2022-04-28 08:32:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 08:32:51,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:32:51,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:32:51,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:32:51,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:32:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:32:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 1 times [2022-04-28 08:32:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237552973] [2022-04-28 08:32:51,189 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:32:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 2 times [2022-04-28 08:32:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:32:51,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552736646] [2022-04-28 08:32:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:32:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:32:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:32:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-28 08:32:51,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 08:32:51,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-28 08:32:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:32:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:32:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,539 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-28 08:32:51,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 08:32:51,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 08:32:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 08:32:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:32:51,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,622 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-28 08:32:51,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,624 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:32:51,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-28 08:32:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:32:51,625 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-28 08:32:51,626 INFO L272 TraceCheckUtils]: 3: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:32:51,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,628 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-28 08:32:51,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,629 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:32:51,630 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-28 08:32:51,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:32:51,631 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-28 08:32:51,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {77535#true} call ULTIMATE.init(); {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:32:51,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-28 08:32:51,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 08:32:51,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-28 08:32:51,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {77535#true} call #t~ret1021 := main(); {77535#true} is VALID [2022-04-28 08:32:51,634 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-28 08:32:51,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 53); {77535#true} is VALID [2022-04-28 08:32:51,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-28 08:32:51,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 36); {77535#true} is VALID [2022-04-28 08:32:51,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-28 08:32:51,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 904); {77535#true} is VALID [2022-04-28 08:32:51,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {77535#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {77535#true} is VALID [2022-04-28 08:32:51,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {77535#true} call _BLAST_init(); {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:32:51,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,637 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,637 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-28 08:32:51,637 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-28 08:32:51,638 INFO L272 TraceCheckUtils]: 18: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:32:51,638 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-28 08:32:51,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-28 08:32:51,639 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 08:32:51,641 INFO L272 TraceCheckUtils]: 26: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:32:51,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-28 08:32:51,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 08:32:51,643 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-28 08:32:51,644 INFO L272 TraceCheckUtils]: 30: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:32:51,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,645 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-28 08:32:51,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 08:32:51,646 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:32:51,647 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-28 08:32:51,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 08:32:51,648 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-28 08:32:51,648 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-28 08:32:51,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {77536#false} assume 0 != ~we_should_unload~0; {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {77536#false} assume !(~s~0 == ~UNLOADED~0); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {77536#false} assume !(-1 == ~status~15); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {77536#false} assume !(~s~0 != ~SKIP2~0); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {77536#false} assume ~s~0 == ~DC~0; {77536#false} is VALID [2022-04-28 08:32:51,648 INFO L272 TraceCheckUtils]: 51: Hoare triple {77536#false} call errorFn(); {77536#false} is VALID [2022-04-28 08:32:51,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {77536#false} assume !false; {77536#false} is VALID [2022-04-28 08:32:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:32:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:32:51,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552736646] [2022-04-28 08:32:51,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552736646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:51,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:51,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:32:51,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:32:51,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237552973] [2022-04-28 08:32:51,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237552973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:32:51,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:32:51,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:32:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853297666] [2022-04-28 08:32:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:32:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-28 08:32:51,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:32:51,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:32:51,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:32:51,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 08:32:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:32:51,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 08:32:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:32:51,698 INFO L87 Difference]: Start difference. First operand 1200 states and 1731 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:33:16,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:21,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:29,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:31,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:33,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:46,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:48,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:50,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-28 08:33:54,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:33:59,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:02,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:08,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:13,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:20,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:35,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:37,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:39,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:34:44,020 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-28 08:34:58,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:02,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:05,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:09,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:16,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:35:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:21,036 INFO L93 Difference]: Finished difference Result 1832 states and 2719 transitions. [2022-04-28 08:35:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 08:35:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-28 08:35:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:35:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:35:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-28 08:35:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:35:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-28 08:35:21,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 1922 transitions. [2022-04-28 08:35:23,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1922 edges. 1922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:23,741 INFO L225 Difference]: With dead ends: 1832 [2022-04-28 08:35:23,741 INFO L226 Difference]: Without dead ends: 1772 [2022-04-28 08:35:23,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-04-28 08:35:23,742 INFO L413 NwaCegarLoop]: 1062 mSDtfsCounter, 2903 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 4438 mSolverCounterSat, 1366 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1366 IncrementalHoareTripleChecker+Valid, 4438 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:35:23,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2936 Valid, 2826 Invalid, 5821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1366 Valid, 4438 Invalid, 17 Unknown, 0 Unchecked, 64.3s Time] [2022-04-28 08:35:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-04-28 08:35:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1272. [2022-04-28 08:35:23,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:35:23,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-28 08:35:23,924 INFO L74 IsIncluded]: Start isIncluded. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-28 08:35:23,925 INFO L87 Difference]: Start difference. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-28 08:35:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:24,015 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-28 08:35:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-28 08:35:24,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:24,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:24,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-28 08:35:24,021 INFO L87 Difference]: Start difference. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-28 08:35:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:35:24,113 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-28 08:35:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-28 08:35:24,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:35:24,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:35:24,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:35:24,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:35:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-28 08:35:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1819 transitions. [2022-04-28 08:35:24,192 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1819 transitions. Word has length 53 [2022-04-28 08:35:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:35:24,192 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1819 transitions. [2022-04-28 08:35:24,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:35:24,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1272 states and 1819 transitions. [2022-04-28 08:35:27,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1819 transitions. [2022-04-28 08:35:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 08:35:27,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:35:27,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:35:27,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:35:27,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:35:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:35:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 1 times [2022-04-28 08:35:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:27,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114925343] [2022-04-28 08:35:27,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:35:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 2 times [2022-04-28 08:35:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:35:27,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149188481] [2022-04-28 08:35:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:35:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:35:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:35:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 08:35:27,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-28 08:35:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 08:35:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 08:35:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,667 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-28 08:35:27,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 08:35:27,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 08:35:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 08:35:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:35:27,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 08:35:27,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 08:35:27,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 08:35:27,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 08:35:27,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 08:35:27,754 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-28 08:35:27,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,756 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-28 08:35:27,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-28 08:35:27,756 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-28 08:35:27,757 INFO L272 TraceCheckUtils]: 3: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 08:35:27,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 08:35:27,757 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-28 08:35:27,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,758 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,759 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-28 08:35:27,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,760 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {87367#true} call ULTIMATE.init(); {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:35:27,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 08:35:27,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-28 08:35:27,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {87367#true} call #t~ret1021 := main(); {87367#true} is VALID [2022-04-28 08:35:27,761 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-28 08:35:27,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 53); {87367#true} is VALID [2022-04-28 08:35:27,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 36); {87367#true} is VALID [2022-04-28 08:35:27,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 904); {87367#true} is VALID [2022-04-28 08:35:27,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {87367#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {87367#true} is VALID [2022-04-28 08:35:27,762 INFO L272 TraceCheckUtils]: 12: Hoare triple {87367#true} call _BLAST_init(); {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:35:27,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,764 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,764 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-28 08:35:27,765 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-28 08:35:27,765 INFO L272 TraceCheckUtils]: 18: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} call stub_driver_init(); {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:35:27,765 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-28 08:35:27,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-28 08:35:27,766 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !!(~status~15 >= 0); {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-28 08:35:27,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !(2 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-28 08:35:27,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume !(3 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-28 08:35:27,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume 4 == ~__BLAST_NONDET___0~0; {87380#(not (= ~SKIP2~0 ~DC~0))} is VALID [2022-04-28 08:35:27,768 INFO L272 TraceCheckUtils]: 26: Hoare triple {87380#(not (= ~SKIP2~0 ~DC~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:35:27,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-28 08:35:27,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-28 08:35:27,768 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-28 08:35:27,768 INFO L272 TraceCheckUtils]: 30: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-28 08:35:27,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-28 08:35:27,769 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-28 08:35:27,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,770 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,770 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-28 08:35:27,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-28 08:35:27,771 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,772 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-28 08:35:27,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~15); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~SKIP2~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-28 08:35:27,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume ~s~0 == ~DC~0; {87368#false} is VALID [2022-04-28 08:35:27,774 INFO L272 TraceCheckUtils]: 53: Hoare triple {87368#false} call errorFn(); {87368#false} is VALID [2022-04-28 08:35:27,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {87368#false} assume !false; {87368#false} is VALID [2022-04-28 08:35:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:35:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:35:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149188481] [2022-04-28 08:35:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149188481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:27,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:27,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:35:27,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:35:27,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114925343] [2022-04-28 08:35:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114925343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:35:27,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:35:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 08:35:27,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488011297] [2022-04-28 08:35:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:35:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-04-28 08:35:27,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:35:27,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 08:35:27,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:35:27,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 08:35:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:35:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 08:35:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 08:35:27,814 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-28 08:35:53,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:03,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:05,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-28 08:36:07,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:09,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:19,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:21,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:26,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:36:29,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []