/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:04:37,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:04:37,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:04:37,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:04:37,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:04:37,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:04:37,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:04:37,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:04:37,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:04:37,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:04:37,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:04:37,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:04:37,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:04:37,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:04:37,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:04:37,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:04:37,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:04:37,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:04:37,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:04:37,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:04:37,389 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:04:37,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:04:37,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:04:37,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:04:37,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:04:37,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:04:37,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:04:37,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:04:37,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:04:37,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:04:37,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:04:37,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:04:37,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:04:37,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:04:37,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:04:37,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:04:37,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:04:37,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:04:37,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:04:37,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:04:37,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:04:37,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:04:37,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:04:37,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:04:37,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:04:37,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:04:37,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:04:37,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:04:37,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:04:37,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:04:37,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:04:37,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:04:37,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:04:37,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:04:37,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:04:37,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:37,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:04:37,417 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:04:37,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:04:37,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:04:37,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:04:37,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:04:37,661 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:04:37,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-15 18:04:37,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4c2353/106e9c625d8b410199e1c846948075a4/FLAGe0aebabc8 [2022-04-15 18:04:38,257 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:04:38,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-15 18:04:38,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4c2353/106e9c625d8b410199e1c846948075a4/FLAGe0aebabc8 [2022-04-15 18:04:38,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4c2353/106e9c625d8b410199e1c846948075a4 [2022-04-15 18:04:38,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:04:38,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:04:38,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:38,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:04:38,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:04:38,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:38" (1/1) ... [2022-04-15 18:04:38,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:38, skipping insertion in model container [2022-04-15 18:04:38,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:38" (1/1) ... [2022-04-15 18:04:38,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:04:38,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:04:39,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-04-15 18:04:39,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:39,901 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:04:39,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-04-15 18:04:40,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:40,224 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:04:40,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40 WrapperNode [2022-04-15 18:04:40,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:40,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:04:40,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:04:40,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:04:40,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:04:40,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:04:40,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:04:40,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:04:40,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (1/1) ... [2022-04-15 18:04:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:04:40,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 18:04:40,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 18:04:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:04:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:04:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:04:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-15 18:04:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-15 18:04:40,538 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-15 18:04:40,539 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-15 18:04:40,539 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-15 18:04:40,539 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-15 18:04:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-15 18:04:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 18:04:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 18:04:40,543 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 18:04:40,544 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-15 18:04:40,545 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-15 18:04:40,545 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-15 18:04:40,545 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-15 18:04:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-15 18:04:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:04:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:04:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:04:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-15 18:04:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-15 18:04:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-15 18:04:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-15 18:04:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-15 18:04:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-15 18:04:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-15 18:04:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-15 18:04:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-15 18:04:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-15 18:04:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-15 18:04:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-15 18:04:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 18:04:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:04:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:04:41,104 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:04:41,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:04:41,132 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,155 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,155 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,155 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,162 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,162 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,173 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,187 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,187 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,188 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,209 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,209 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,211 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,185 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 18:04:47,185 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 18:04:47,203 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,212 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,213 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,213 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,223 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,235 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,235 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,236 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,249 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,249 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,252 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:51,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:04:51,912 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:04:51,917 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,058 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-15 18:04:52,058 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-15 18:04:52,071 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,077 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:52,078 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:52,082 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,107 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 18:04:52,107 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 18:04:52,108 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,117 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:52,117 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:52,117 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,123 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:52,123 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:52,139 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:52,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:52,153 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:52,159 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:52,159 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:52,500 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:55,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:04:55,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:04:55,815 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,597 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-15 18:05:01,597 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-15 18:05:01,605 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,628 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-15 18:05:01,628 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-15 18:05:01,651 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,656 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:05:01,656 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:05:01,696 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-15 18:05:01,760 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-15 18:05:01,844 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,848 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:05:01,848 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:05:01,972 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:01,976 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:05:01,976 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:05:01,977 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:05,622 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 18:05:05,622 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 18:05:05,626 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:05,647 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-15 18:05:05,648 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-15 18:05:05,655 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:05,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 18:05:05,663 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 18:05:05,722 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:05,726 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:05:05,726 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:05:06,014 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:06,053 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-15 18:05:06,053 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-15 18:05:06,054 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-15 18:05:06,054 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:06,058 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:05:06,058 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:05:06,114 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:05:14,327 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:05:14,328 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:05:14,396 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:05:14,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:05:14,411 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-04-15 18:05:14,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:05:14 BoogieIcfgContainer [2022-04-15 18:05:14,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:05:14,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:05:14,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:05:14,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:05:14,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:04:38" (1/3) ... [2022-04-15 18:05:14,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2497230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:05:14, skipping insertion in model container [2022-04-15 18:05:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:40" (2/3) ... [2022-04-15 18:05:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2497230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:05:14, skipping insertion in model container [2022-04-15 18:05:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:05:14" (3/3) ... [2022-04-15 18:05:14,424 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-04-15 18:05:14,428 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:05:14,428 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:05:14,467 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:05:14,471 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:05:14,471 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:05:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-15 18:05:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:05:14,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:14,515 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:05:14,515 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 1 times [2022-04-15 18:05:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184348761] [2022-04-15 18:05:14,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 2 times [2022-04-15 18:05:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:14,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956805128] [2022-04-15 18:05:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:15,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-15 18:05:15,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-15 18:05:15,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-15 18:05:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:05:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:15,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {1256#true} call ULTIMATE.init(); {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:05:15,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-15 18:05:15,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-15 18:05:15,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-15 18:05:15,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1256#true} call #t~ret1013 := main(); {1256#true} is VALID [2022-04-15 18:05:15,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1256#true} is VALID [2022-04-15 18:05:15,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {1256#true} call _BLAST_init(); {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:05:15,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,094 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1257#false} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#false} assume !(-1 == ~status~15); {1257#false} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#false} assume !(~s~0 != ~SKIP2~0); {1257#false} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#false} assume 1 == ~pended~0; {1257#false} is VALID [2022-04-15 18:05:15,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#false} assume 259 != ~status~15; {1257#false} is VALID [2022-04-15 18:05:15,096 INFO L272 TraceCheckUtils]: 18: Hoare triple {1257#false} call errorFn(); {1257#false} is VALID [2022-04-15 18:05:15,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-04-15 18:05:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:05:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:15,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956805128] [2022-04-15 18:05:15,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956805128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:15,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:15,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:05:15,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:15,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184348761] [2022-04-15 18:05:15,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184348761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:15,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:15,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:05:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394747183] [2022-04-15 18:05:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:15,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-15 18:05:15,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:15,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:15,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:15,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:05:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:05:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:05:15,162 INFO L87 Difference]: Start difference. First operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:27,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:34,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:40,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:45,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:49,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-15 18:05:56,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-15 18:06:01,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:08,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:13,187 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-15 18:06:16,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:19,640 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-15 18:06:21,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:23,665 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-15 18:06:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:24,451 INFO L93 Difference]: Finished difference Result 1365 states and 2147 transitions. [2022-04-15 18:06:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:06:24,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-15 18:06:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:06:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-15 18:06:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:06:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-15 18:06:24,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2147 transitions. [2022-04-15 18:06:26,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:27,032 INFO L225 Difference]: With dead ends: 1365 [2022-04-15 18:06:27,032 INFO L226 Difference]: Without dead ends: 834 [2022-04-15 18:06:27,038 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 18:06:27,040 INFO L913 BasicCegarLoop]: 920 mSDtfsCounter, 460 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 187 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:27,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1300 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1972 Invalid, 10 Unknown, 0 Unchecked, 32.5s Time] [2022-04-15 18:06:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-15 18:06:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 671. [2022-04-15 18:06:27,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:27,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:06:27,130 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:06:27,131 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:06:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:27,177 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-15 18:06:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-15 18:06:27,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:27,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:27,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-15 18:06:27,186 INFO L87 Difference]: Start difference. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-15 18:06:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:27,234 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-15 18:06:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-15 18:06:27,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:27,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:27,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:27,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:06:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 980 transitions. [2022-04-15 18:06:27,275 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 980 transitions. Word has length 20 [2022-04-15 18:06:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:27,275 INFO L478 AbstractCegarLoop]: Abstraction has 671 states and 980 transitions. [2022-04-15 18:06:27,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:06:27,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 671 states and 980 transitions. [2022-04-15 18:06:28,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 980 edges. 980 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 980 transitions. [2022-04-15 18:06:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 18:06:28,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:06:28,328 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:06:28,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:06:28,328 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:06:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:06:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 1 times [2022-04-15 18:06:28,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090342771] [2022-04-15 18:06:28,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:06:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 2 times [2022-04-15 18:06:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:06:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384762034] [2022-04-15 18:06:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:06:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:06:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:06:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:28,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-15 18:06:28,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 18:06:28,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-15 18:06:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:06:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:28,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-15 18:06:28,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 18:06:28,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-15 18:06:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:06:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:28,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {7014#true} call ULTIMATE.init(); {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:06:28,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-15 18:06:28,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 18:06:28,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-15 18:06:28,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {7014#true} call #t~ret1013 := main(); {7014#true} is VALID [2022-04-15 18:06:28,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {7014#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7014#true} is VALID [2022-04-15 18:06:28,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {7014#true} call _BLAST_init(); {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:06:28,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-15 18:06:28,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-15 18:06:28,622 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-15 18:06:28,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {7014#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {7014#true} is VALID [2022-04-15 18:06:28,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {7014#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {7014#true} is VALID [2022-04-15 18:06:28,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {7014#true} call stub_driver_init(); {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:06:28,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,627 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {7025#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,629 INFO L272 TraceCheckUtils]: 20: Hoare triple {7025#(= ~s~0 ~NP~0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {7025#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:06:28,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7015#false} is VALID [2022-04-15 18:06:28,630 INFO L272 TraceCheckUtils]: 23: Hoare triple {7015#false} call errorFn(); {7015#false} is VALID [2022-04-15 18:06:28,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {7015#false} assume !false; {7015#false} is VALID [2022-04-15 18:06:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:06:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:06:28,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384762034] [2022-04-15 18:06:28,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384762034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:28,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:28,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:06:28,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:06:28,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090342771] [2022-04-15 18:06:28,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090342771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:28,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:28,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:06:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605612129] [2022-04-15 18:06:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:06:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 18:06:28,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:06:28,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:28,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:28,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:06:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:06:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:06:28,655 INFO L87 Difference]: Start difference. First operand 671 states and 980 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:44,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-15 18:06:48,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:59,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:05,710 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-15 18:07:13,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:19,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:27,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:29,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:07:29,899 INFO L93 Difference]: Finished difference Result 1451 states and 2142 transitions. [2022-04-15 18:07:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 18:07:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 18:07:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:07:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-15 18:07:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-15 18:07:29,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2142 transitions. [2022-04-15 18:07:32,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2142 edges. 2142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:32,359 INFO L225 Difference]: With dead ends: 1451 [2022-04-15 18:07:32,360 INFO L226 Difference]: Without dead ends: 1173 [2022-04-15 18:07:32,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:07:32,361 INFO L913 BasicCegarLoop]: 1222 mSDtfsCounter, 1922 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 565 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:07:32,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1960 Valid, 1964 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1806 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2022-04-15 18:07:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-04-15 18:07:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 983. [2022-04-15 18:07:32,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:07:32,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:07:32,442 INFO L74 IsIncluded]: Start isIncluded. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:07:32,444 INFO L87 Difference]: Start difference. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:07:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:07:32,497 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-15 18:07:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-15 18:07:32,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:07:32,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:07:32,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-15 18:07:32,505 INFO L87 Difference]: Start difference. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-15 18:07:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:07:32,559 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-15 18:07:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-15 18:07:32,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:07:32,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:07:32,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:07:32,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:07:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:07:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1437 transitions. [2022-04-15 18:07:32,622 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1437 transitions. Word has length 25 [2022-04-15 18:07:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:07:32,623 INFO L478 AbstractCegarLoop]: Abstraction has 983 states and 1437 transitions. [2022-04-15 18:07:32,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:32,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 983 states and 1437 transitions. [2022-04-15 18:07:34,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1437 transitions. [2022-04-15 18:07:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:07:34,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:07:34,387 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:07:34,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:07:34,387 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:07:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:07:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 1 times [2022-04-15 18:07:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:34,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398833853] [2022-04-15 18:07:34,388 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:07:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 2 times [2022-04-15 18:07:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:07:34,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503259654] [2022-04-15 18:07:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:07:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:07:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:07:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:34,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-15 18:07:34,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-15 18:07:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:07:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:34,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-15 18:07:34,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-15 18:07:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:07:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:07:34,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14251#true} is VALID [2022-04-15 18:07:34,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-15 18:07:34,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {14251#true} call ULTIMATE.init(); {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:07:34,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-15 18:07:34,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-15 18:07:34,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {14251#true} call #t~ret1013 := main(); {14251#true} is VALID [2022-04-15 18:07:34,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {14251#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14251#true} is VALID [2022-04-15 18:07:34,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {14251#true} call _BLAST_init(); {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:07:34,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {14264#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-15 18:07:34,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,598 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-15 18:07:34,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {14251#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {14251#true} is VALID [2022-04-15 18:07:34,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {14251#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L272 TraceCheckUtils]: 12: Hoare triple {14251#true} call stub_driver_init(); {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:07:34,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {14251#true} assume !!(~status~15 >= 0); {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {14251#true} assume !(2 == ~__BLAST_NONDET___0~0); {14251#true} is VALID [2022-04-15 18:07:34,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {14251#true} assume 3 == ~__BLAST_NONDET___0~0; {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {14251#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {14251#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {14251#true} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {14251#true} assume 22 == #t~mem134 % 256;havoc #t~mem134; {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {14251#true} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {14251#true} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {14251#true} is VALID [2022-04-15 18:07:34,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {14251#true} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14251#true} is VALID [2022-04-15 18:07:34,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {14251#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {14251#true} is VALID [2022-04-15 18:07:34,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {14251#true} assume !(~s~0 == ~MPR3~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:07:34,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:07:34,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14252#false} is VALID [2022-04-15 18:07:34,602 INFO L272 TraceCheckUtils]: 30: Hoare triple {14252#false} call errorFn(); {14252#false} is VALID [2022-04-15 18:07:34,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {14252#false} assume !false; {14252#false} is VALID [2022-04-15 18:07:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:07:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:07:34,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503259654] [2022-04-15 18:07:34,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503259654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:34,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:34,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:07:34,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:07:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398833853] [2022-04-15 18:07:34,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398833853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:07:34,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:07:34,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:07:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521914642] [2022-04-15 18:07:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:07:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-15 18:07:34,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:07:34,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:34,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:07:34,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:07:34,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:07:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:07:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:07:34,633 INFO L87 Difference]: Start difference. First operand 983 states and 1437 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:51,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:55,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:03,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:11,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:16,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:18,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:22,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:24,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:32,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:37,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:41,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:44,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:47,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:51,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-15 18:08:59,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:00,122 INFO L93 Difference]: Finished difference Result 2287 states and 3438 transitions. [2022-04-15 18:09:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:09:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-04-15 18:09:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:09:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:09:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-15 18:09:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:09:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-15 18:09:00,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2358 transitions. [2022-04-15 18:09:03,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2358 edges. 2358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:03,204 INFO L225 Difference]: With dead ends: 2287 [2022-04-15 18:09:03,204 INFO L226 Difference]: Without dead ends: 1830 [2022-04-15 18:09:03,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:09:03,208 INFO L913 BasicCegarLoop]: 1374 mSDtfsCounter, 1545 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 516 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2022-04-15 18:09:03,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 2171 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2314 Invalid, 10 Unknown, 0 Unchecked, 36.7s Time] [2022-04-15 18:09:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-04-15 18:09:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1164. [2022-04-15 18:09:03,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:09:03,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:09:03,305 INFO L74 IsIncluded]: Start isIncluded. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:09:03,307 INFO L87 Difference]: Start difference. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:09:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:03,427 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-15 18:09:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-15 18:09:03,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:03,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:03,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-15 18:09:03,437 INFO L87 Difference]: Start difference. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-15 18:09:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:03,571 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-15 18:09:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-15 18:09:03,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:03,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:03,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:09:03,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:09:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:09:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1722 transitions. [2022-04-15 18:09:03,658 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1722 transitions. Word has length 32 [2022-04-15 18:09:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:09:03,658 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1722 transitions. [2022-04-15 18:09:03,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:09:03,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1722 transitions. [2022-04-15 18:09:06,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1722 transitions. [2022-04-15 18:09:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 18:09:06,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:09:06,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:09:06,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:09:06,166 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:09:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:09:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 1 times [2022-04-15 18:09:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:09:06,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [322738970] [2022-04-15 18:09:06,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:09:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 2 times [2022-04-15 18:09:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:09:06,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79988922] [2022-04-15 18:09:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:09:06,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:09:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:09:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:06,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-15 18:09:06,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-15 18:09:06,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-15 18:09:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:09:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:06,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:09:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:06,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:09:06,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:09:06,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {24835#true} call ULTIMATE.init(); {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:09:06,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-15 18:09:06,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-15 18:09:06,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-15 18:09:06,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {24835#true} call #t~ret1013 := main(); {24835#true} is VALID [2022-04-15 18:09:06,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {24835#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {24835#true} is VALID [2022-04-15 18:09:06,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {24835#true} call _BLAST_init(); {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:09:06,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,435 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:09:06,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:09:06,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:09:06,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:09:06,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,438 INFO L272 TraceCheckUtils]: 19: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem134 % 256;havoc #t~mem134; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,440 INFO L272 TraceCheckUtils]: 25: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:09:06,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-15 18:09:06,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#false} assume !(1 == ~setEventCalled~0); {24836#false} is VALID [2022-04-15 18:09:06,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#false} assume !(1 == ~customIrp~0); {24836#false} is VALID [2022-04-15 18:09:06,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {24836#false} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-15 18:09:06,441 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#false} call errorFn(); {24836#false} is VALID [2022-04-15 18:09:06,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#false} assume !false; {24836#false} is VALID [2022-04-15 18:09:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:09:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:09:06,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79988922] [2022-04-15 18:09:06,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79988922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:09:06,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:09:06,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:09:06,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:09:06,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [322738970] [2022-04-15 18:09:06,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [322738970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:09:06,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:09:06,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:09:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618259735] [2022-04-15 18:09:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:09:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-15 18:09:06,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:09:06,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:09:06,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:06,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 18:09:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:09:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 18:09:06,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:09:06,470 INFO L87 Difference]: Start difference. First operand 1164 states and 1722 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:09:33,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:42,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:44,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-15 18:09:46,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:53,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:55,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:02,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:04,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:05,615 INFO L93 Difference]: Finished difference Result 2216 states and 3337 transitions. [2022-04-15 18:10:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 18:10:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-15 18:10:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:10:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:10:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-15 18:10:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:10:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-15 18:10:05,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2771 transitions. [2022-04-15 18:10:08,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2771 edges. 2771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:08,943 INFO L225 Difference]: With dead ends: 2216 [2022-04-15 18:10:08,943 INFO L226 Difference]: Without dead ends: 1508 [2022-04-15 18:10:08,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-15 18:10:08,946 INFO L913 BasicCegarLoop]: 1356 mSDtfsCounter, 3252 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 1171 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1171 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:10:08,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3283 Valid, 2626 Invalid, 4911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1171 Valid, 3734 Invalid, 6 Unknown, 0 Unchecked, 27.6s Time] [2022-04-15 18:10:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-15 18:10:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1158. [2022-04-15 18:10:09,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:10:09,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:10:09,049 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:10:09,052 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:10:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:09,146 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-15 18:10:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-15 18:10:09,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:09,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:09,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-15 18:10:09,156 INFO L87 Difference]: Start difference. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-15 18:10:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:09,268 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-15 18:10:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-15 18:10:09,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:09,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:09,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:10:09,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:10:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:10:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1710 transitions. [2022-04-15 18:10:09,390 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1710 transitions. Word has length 33 [2022-04-15 18:10:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:10:09,390 INFO L478 AbstractCegarLoop]: Abstraction has 1158 states and 1710 transitions. [2022-04-15 18:10:09,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:10:09,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1158 states and 1710 transitions. [2022-04-15 18:10:12,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1710 edges. 1710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1710 transitions. [2022-04-15 18:10:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:10:12,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:10:12,442 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:10:12,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:10:12,442 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:10:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:10:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 1 times [2022-04-15 18:10:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:12,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2115045556] [2022-04-15 18:10:12,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:10:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 2 times [2022-04-15 18:10:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:10:12,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675105380] [2022-04-15 18:10:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:10:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:10:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:10:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:12,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-15 18:10:12,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 18:10:12,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-15 18:10:12,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:10:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:12,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-15 18:10:12,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 18:10:12,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-15 18:10:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:10:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:12,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {34635#true} call ULTIMATE.init(); {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:10:12,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-15 18:10:12,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 18:10:12,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-15 18:10:12,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {34635#true} call #t~ret1013 := main(); {34635#true} is VALID [2022-04-15 18:10:12,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {34635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {34635#true} is VALID [2022-04-15 18:10:12,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {34635#true} call _BLAST_init(); {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:10:12,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {34648#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-15 18:10:12,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-15 18:10:12,785 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-15 18:10:12,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {34635#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {34635#true} is VALID [2022-04-15 18:10:12,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {34635#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {34635#true} is VALID [2022-04-15 18:10:12,786 INFO L272 TraceCheckUtils]: 12: Hoare triple {34635#true} call stub_driver_init(); {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:10:12,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,788 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {34646#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {34646#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,790 INFO L272 TraceCheckUtils]: 20: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {34646#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,792 INFO L272 TraceCheckUtils]: 24: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {34646#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {34636#false} assume 0 == ~routine~0; {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L272 TraceCheckUtils]: 28: Hoare triple {34636#false} call #t~ret1004 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {34636#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {34636#false} assume 0 != ~myIrp_PendingReturned~0; {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {34636#false} assume !(0 == ~pended~0); {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L272 TraceCheckUtils]: 32: Hoare triple {34636#false} call errorFn(); {34636#false} is VALID [2022-04-15 18:10:12,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {34636#false} assume !false; {34636#false} is VALID [2022-04-15 18:10:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:10:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:10:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675105380] [2022-04-15 18:10:12,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675105380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:12,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:12,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:10:12,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:10:12,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2115045556] [2022-04-15 18:10:12,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2115045556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:12,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:12,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:10:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811966461] [2022-04-15 18:10:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:10:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 18:10:12,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:10:12,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:12,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:12,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:10:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:10:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:10:12,829 INFO L87 Difference]: Start difference. First operand 1158 states and 1710 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:30,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:34,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:41,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:46,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:51,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:53,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:54,124 INFO L93 Difference]: Finished difference Result 2061 states and 3001 transitions. [2022-04-15 18:10:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 18:10:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 18:10:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:10:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-15 18:10:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-15 18:10:54,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1787 transitions. [2022-04-15 18:10:56,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:56,476 INFO L225 Difference]: With dead ends: 2061 [2022-04-15 18:10:56,476 INFO L226 Difference]: Without dead ends: 1892 [2022-04-15 18:10:56,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:10:56,477 INFO L913 BasicCegarLoop]: 1124 mSDtfsCounter, 1421 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 333 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:10:56,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1465 Valid, 1822 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1520 Invalid, 5 Unknown, 0 Unchecked, 17.5s Time] [2022-04-15 18:10:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-04-15 18:10:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2022-04-15 18:10:56,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:10:56,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:56,615 INFO L74 IsIncluded]: Start isIncluded. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:56,617 INFO L87 Difference]: Start difference. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:56,747 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-15 18:10:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-15 18:10:56,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:56,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:56,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-15 18:10:56,754 INFO L87 Difference]: Start difference. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-15 18:10:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:56,865 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-15 18:10:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-15 18:10:56,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:56,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:56,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:10:56,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:10:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2381 transitions. [2022-04-15 18:10:57,007 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2381 transitions. Word has length 34 [2022-04-15 18:10:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:10:57,007 INFO L478 AbstractCegarLoop]: Abstraction has 1623 states and 2381 transitions. [2022-04-15 18:10:57,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:57,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1623 states and 2381 transitions. [2022-04-15 18:11:00,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2381 edges. 2381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2381 transitions. [2022-04-15 18:11:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 18:11:00,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:11:00,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:11:00,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:11:00,384 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:11:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:11:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 1 times [2022-04-15 18:11:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:00,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413516266] [2022-04-15 18:11:00,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:11:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 2 times [2022-04-15 18:11:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:11:00,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746944747] [2022-04-15 18:11:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:11:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:11:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:11:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:00,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-15 18:11:00,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-15 18:11:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:11:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:00,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-15 18:11:00,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-15 18:11:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:11:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:11:00,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {45810#true} is VALID [2022-04-15 18:11:00,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-15 18:11:00,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {45810#true} call ULTIMATE.init(); {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:11:00,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-15 18:11:00,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-15 18:11:00,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {45810#true} call #t~ret1013 := main(); {45810#true} is VALID [2022-04-15 18:11:00,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {45810#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {45810#true} is VALID [2022-04-15 18:11:00,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {45810#true} call _BLAST_init(); {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:11:00,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {45823#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-15 18:11:00,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,614 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-15 18:11:00,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {45810#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {45810#true} is VALID [2022-04-15 18:11:00,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {45810#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L272 TraceCheckUtils]: 12: Hoare triple {45810#true} call stub_driver_init(); {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:11:00,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {45810#true} assume !!(~status~15 >= 0); {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {45810#true} assume !(2 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-15 18:11:00,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {45810#true} assume !(3 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-15 18:11:00,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {45810#true} assume 4 == ~__BLAST_NONDET___0~0; {45810#true} is VALID [2022-04-15 18:11:00,616 INFO L272 TraceCheckUtils]: 20: Hoare triple {45810#true} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {45810#true} is VALID [2022-04-15 18:11:00,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {45810#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {45810#true} is VALID [2022-04-15 18:11:00,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {45810#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,618 INFO L272 TraceCheckUtils]: 24: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:11:00,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {45811#false} is VALID [2022-04-15 18:11:00,621 INFO L272 TraceCheckUtils]: 32: Hoare triple {45811#false} call errorFn(); {45811#false} is VALID [2022-04-15 18:11:00,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {45811#false} assume !false; {45811#false} is VALID [2022-04-15 18:11:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:11:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:11:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746944747] [2022-04-15 18:11:00,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746944747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:00,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:00,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:11:00,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:11:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413516266] [2022-04-15 18:11:00,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413516266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:11:00,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:11:00,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:11:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103069051] [2022-04-15 18:11:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:11:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 18:11:00,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:11:00,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:11:00,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:00,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:11:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:11:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:11:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:11:00,651 INFO L87 Difference]: Start difference. First operand 1623 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:11:21,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:25,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:29,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:31,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:38,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:42,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:50,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:52,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:54,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:58,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:02,241 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-15 18:12:07,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:10,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:12,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:13,390 INFO L93 Difference]: Finished difference Result 1760 states and 2607 transitions. [2022-04-15 18:12:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:12:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-15 18:12:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:12:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-15 18:12:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:12:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-15 18:12:13,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1223 transitions. [2022-04-15 18:12:14,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1223 edges. 1223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:15,055 INFO L225 Difference]: With dead ends: 1760 [2022-04-15 18:12:15,055 INFO L226 Difference]: Without dead ends: 1756 [2022-04-15 18:12:15,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:12:15,056 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 903 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 360 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:15,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 1471 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1626 Invalid, 13 Unknown, 0 Unchecked, 36.1s Time] [2022-04-15 18:12:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-04-15 18:12:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1622. [2022-04-15 18:12:15,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:15,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:15,208 INFO L74 IsIncluded]: Start isIncluded. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:15,209 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:15,310 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-15 18:12:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-15 18:12:15,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:15,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:15,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-15 18:12:15,318 INFO L87 Difference]: Start difference. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-15 18:12:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:15,420 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-15 18:12:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-15 18:12:15,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:15,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:15,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:15,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2378 transitions. [2022-04-15 18:12:15,593 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2378 transitions. Word has length 34 [2022-04-15 18:12:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:15,594 INFO L478 AbstractCegarLoop]: Abstraction has 1622 states and 2378 transitions. [2022-04-15 18:12:15,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:12:15,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1622 states and 2378 transitions. [2022-04-15 18:12:19,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2378 transitions. [2022-04-15 18:12:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 18:12:19,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:19,678 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:19,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:12:19,678 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 1 times [2022-04-15 18:12:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687403172] [2022-04-15 18:12:19,679 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:12:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 2 times [2022-04-15 18:12:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368779503] [2022-04-15 18:12:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:19,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-15 18:12:19,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:19,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-15 18:12:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:12:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:19,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-15 18:12:19,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:19,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-15 18:12:19,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:12:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:19,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56108#true} is VALID [2022-04-15 18:12:19,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:19,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-15 18:12:19,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 18:12:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:20,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-15 18:12:20,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-15 18:12:20,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {56108#true} is VALID [2022-04-15 18:12:20,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-15 18:12:20,016 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-15 18:12:20,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {56108#true} call ULTIMATE.init(); {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:20,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-15 18:12:20,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:20,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-15 18:12:20,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {56108#true} call #t~ret1013 := main(); {56108#true} is VALID [2022-04-15 18:12:20,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {56108#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56108#true} is VALID [2022-04-15 18:12:20,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {56108#true} call _BLAST_init(); {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:12:20,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {56127#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-15 18:12:20,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:20,020 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-15 18:12:20,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {56108#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {56108#true} is VALID [2022-04-15 18:12:20,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {56108#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L272 TraceCheckUtils]: 12: Hoare triple {56108#true} call stub_driver_init(); {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:12:20,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {56108#true} assume !!(~status~15 >= 0); {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {56108#true} assume !(2 == ~__BLAST_NONDET___0~0); {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {56108#true} assume 3 == ~__BLAST_NONDET___0~0; {56108#true} is VALID [2022-04-15 18:12:20,024 INFO L272 TraceCheckUtils]: 19: Hoare triple {56108#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#true} assume 0 == #t~mem133 % 256;havoc #t~mem133; {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L272 TraceCheckUtils]: 22: Hoare triple {56108#true} call #t~ret135 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(57);havoc ~cdb~0.base, ~cdb~0.offset;havoc ~inquiryDataPtr~0.base, ~inquiryDataPtr~0.offset;havoc ~attempt~0;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~tmp___11~0;havoc ~tmp___12~0;havoc ~tmp___13~0;havoc ~tmp___14~0;havoc ~tmp___15~0;call ~#deviceParameterHandle~1.base, ~#deviceParameterHandle~1.offset := #Ultimate.allocOnStack(8);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(8);call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem67.base, #t~mem67.offset;havoc #t~mem67.base, #t~mem67.offset; {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L272 TraceCheckUtils]: 24: Hoare triple {56108#true} call #t~ret68 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-15 18:12:20,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(28);havoc ~status~14;havoc ~irpSp~2.base, ~irpSp~2.offset;havoc ~nextIrpSp~1.base, ~nextIrpSp~1.offset;havoc ~irpSp___0~1.base, ~irpSp___0~1.offset;call #t~mem948.base, #t~mem948.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem948.base, #t~mem948.offset;havoc #t~mem948.base, #t~mem948.offset;call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~2.base, ~irpSp~2.offset := #t~mem949.base, #t~mem949.offset;havoc #t~mem949.base, #t~mem949.offset;call #t~mem950.base, #t~mem950.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem950.base, #t~mem950.offset - 68;havoc #t~mem950.base, #t~mem950.offset; {56108#true} is VALID [2022-04-15 18:12:20,026 INFO L272 TraceCheckUtils]: 26: Hoare triple {56108#true} call #t~memmove~res951.base, #t~memmove~res951.offset := #Ultimate.C_memmove(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 52); {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 18:12:20,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-15 18:12:20,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {56108#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-15 18:12:20,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {56108#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {56108#true} is VALID [2022-04-15 18:12:20,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-15 18:12:20,027 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-15 18:12:20,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {56108#true} havoc #t~memmove~res951.base, #t~memmove~res951.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56108#true} is VALID [2022-04-15 18:12:20,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {56108#true} assume !(~s~0 != ~NP~0); {56108#true} is VALID [2022-04-15 18:12:20,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {56108#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:20,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem952.base, #t~mem952.offset - 68;havoc #t~mem952.base, #t~mem952.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 52 + ~irpSp___0~1.offset, 8);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 60 + ~irpSp___0~1.offset, 8);call write~int(0, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(64, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call #t~mem953 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem953 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem953;call #t~mem954 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem954 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem954;call #t~mem955.base, #t~mem955.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 8); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:20,028 INFO L272 TraceCheckUtils]: 36: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~ret956 := IofCallDriver(#t~mem955.base, #t~mem955.offset, ~Irp.base, ~Irp.offset); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:20,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:20,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56125#(not (= ~routine~0 0))} is VALID [2022-04-15 18:12:20,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {56125#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56109#false} is VALID [2022-04-15 18:12:20,036 INFO L272 TraceCheckUtils]: 40: Hoare triple {56109#false} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56109#false} is VALID [2022-04-15 18:12:20,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {56109#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56109#false} is VALID [2022-04-15 18:12:20,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {56109#false} assume 0 != ~myIrp_PendingReturned~0; {56109#false} is VALID [2022-04-15 18:12:20,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {56109#false} assume !(0 == ~pended~0); {56109#false} is VALID [2022-04-15 18:12:20,036 INFO L272 TraceCheckUtils]: 44: Hoare triple {56109#false} call errorFn(); {56109#false} is VALID [2022-04-15 18:12:20,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {56109#false} assume !false; {56109#false} is VALID [2022-04-15 18:12:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:12:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:20,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368779503] [2022-04-15 18:12:20,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368779503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:20,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:20,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:12:20,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:20,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687403172] [2022-04-15 18:12:20,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687403172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:20,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:20,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:12:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045317696] [2022-04-15 18:12:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-15 18:12:20,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:20,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:12:20,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:20,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 18:12:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 18:12:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:12:20,089 INFO L87 Difference]: Start difference. First operand 1622 states and 2378 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:12:40,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:47,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:49,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:51,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:58,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:03,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:08,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:17,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:22,440 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-15 18:13:39,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:42,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:44,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:57,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:00,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:04,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:06,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:09,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:16,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:18,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:19,493 INFO L93 Difference]: Finished difference Result 2729 states and 4036 transitions. [2022-04-15 18:14:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 18:14:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-15 18:14:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:14:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-15 18:14:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-15 18:14:19,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 2095 transitions. [2022-04-15 18:14:22,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2095 edges. 2095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:22,366 INFO L225 Difference]: With dead ends: 2729 [2022-04-15 18:14:22,367 INFO L226 Difference]: Without dead ends: 1590 [2022-04-15 18:14:22,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-04-15 18:14:22,370 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 2049 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 1041 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:14:22,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2075 Valid, 1618 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2544 Invalid, 15 Unknown, 0 Unchecked, 54.2s Time] [2022-04-15 18:14:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-04-15 18:14:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1195. [2022-04-15 18:14:22,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:14:22,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:22,565 INFO L74 IsIncluded]: Start isIncluded. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:22,566 INFO L87 Difference]: Start difference. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:22,698 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-15 18:14:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-15 18:14:22,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:22,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-15 18:14:22,707 INFO L87 Difference]: Start difference. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-15 18:14:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:22,838 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-15 18:14:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-15 18:14:22,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:22,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:22,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:14:22,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:14:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1731 transitions. [2022-04-15 18:14:22,960 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1731 transitions. Word has length 46 [2022-04-15 18:14:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:14:22,960 INFO L478 AbstractCegarLoop]: Abstraction has 1195 states and 1731 transitions. [2022-04-15 18:14:22,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:22,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1195 states and 1731 transitions. [2022-04-15 18:14:26,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1731 transitions. [2022-04-15 18:14:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 18:14:26,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:26,571 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:14:26,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:14:26,571 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 1 times [2022-04-15 18:14:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114057342] [2022-04-15 18:14:26,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:14:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 2 times [2022-04-15 18:14:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300808986] [2022-04-15 18:14:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:26,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:14:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:26,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-15 18:14:26,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 18:14:26,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:14:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:26,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67182#true} is VALID [2022-04-15 18:14:26,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 18:14:26,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 18:14:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:26,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-15 18:14:26,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-15 18:14:26,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {67182#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {67182#true} is VALID [2022-04-15 18:14:26,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-15 18:14:26,871 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {67182#true} call ULTIMATE.init(); {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:26,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret1013 := main(); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:14:26,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {67200#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-15 18:14:26,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 18:14:26,876 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,878 INFO L272 TraceCheckUtils]: 12: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:14:26,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67182#true} is VALID [2022-04-15 18:14:26,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-15 18:14:26,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,880 INFO L272 TraceCheckUtils]: 18: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret972 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem162.base, #t~mem162.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem162.base, #t~mem162.offset;havoc #t~mem162.base, #t~mem162.offset;call #t~mem163 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem163 % 256);havoc #t~mem163;call #t~mem164 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem164 % 256);havoc #t~mem164;call #t~mem165 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem165 % 256);havoc #t~mem165;call #t~mem166 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem166 % 256;havoc #t~mem166; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,882 INFO L272 TraceCheckUtils]: 24: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret170 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem935.base, #t~mem935.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem935.base, #t~mem935.offset;havoc #t~mem935.base, #t~mem935.offset;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem936.base, #t~mem936.offset - 68;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem937.base, #t~mem937.offset;havoc #t~mem937.base, #t~mem937.offset;call #t~mem938 := read~int(~currentIrpStack~7.base, 20 + ~currentIrpStack~7.offset, 8); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume #t~mem938 % 18446744073709551616 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 18446744073709551616;havoc #t~mem938;call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~1.base, ~irpSp~1.offset := #t~mem939.base, #t~mem939.offset;havoc #t~mem939.base, #t~mem939.offset;call #t~mem940.base, #t~mem940.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem940.base, #t~mem940.offset - 68;havoc #t~mem940.base, #t~mem940.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,884 INFO L272 TraceCheckUtils]: 27: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~memmove~res941.base, #t~memmove~res941.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 52); {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 18:14:26,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-15 18:14:26,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {67182#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-15 18:14:26,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {67182#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {67182#true} is VALID [2022-04-15 18:14:26,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-15 18:14:26,885 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc #t~memmove~res941.base, #t~memmove~res941.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem942.base, #t~mem942.offset - 68;havoc #t~mem942.base, #t~mem942.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 52 + ~irpSp___0~0.offset, 8);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 60 + ~irpSp___0~0.offset, 8);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem943 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem943 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem943;call #t~mem944 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem944 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem944;call #t~mem945.base, #t~mem945.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 8); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,887 INFO L272 TraceCheckUtils]: 37: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret946 := IofCallDriver(#t~mem945.base, #t~mem945.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,889 INFO L272 TraceCheckUtils]: 41: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:26,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67183#false} is VALID [2022-04-15 18:14:26,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {67183#false} assume !(0 == ~pended~0); {67183#false} is VALID [2022-04-15 18:14:26,890 INFO L272 TraceCheckUtils]: 45: Hoare triple {67183#false} call errorFn(); {67183#false} is VALID [2022-04-15 18:14:26,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {67183#false} assume !false; {67183#false} is VALID [2022-04-15 18:14:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:14:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:26,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300808986] [2022-04-15 18:14:26,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300808986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:26,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 18:14:26,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114057342] [2022-04-15 18:14:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114057342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:26,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 18:14:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442768321] [2022-04-15 18:14:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:26,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-15 18:14:26,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:26,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:14:26,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:26,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 18:14:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 18:14:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 18:14:26,944 INFO L87 Difference]: Start difference. First operand 1195 states and 1731 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:14:46,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:53,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:57,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:01,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:03,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:10,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:12,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:14,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:18,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:27,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:29,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:31,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:35,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:41,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:44,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:48,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:52,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:53,007 INFO L93 Difference]: Finished difference Result 2147 states and 3201 transitions. [2022-04-15 18:15:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 18:15:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-15 18:15:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-15 18:15:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-15 18:15:53,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1894 transitions. [2022-04-15 18:15:55,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1894 edges. 1894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:55,631 INFO L225 Difference]: With dead ends: 2147 [2022-04-15 18:15:55,631 INFO L226 Difference]: Without dead ends: 1478 [2022-04-15 18:15:55,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-15 18:15:55,633 INFO L913 BasicCegarLoop]: 738 mSDtfsCounter, 1787 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 753 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:55,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 1168 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2304 Invalid, 13 Unknown, 0 Unchecked, 46.7s Time] [2022-04-15 18:15:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-04-15 18:15:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1192. [2022-04-15 18:15:55,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:55,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:55,788 INFO L74 IsIncluded]: Start isIncluded. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:55,790 INFO L87 Difference]: Start difference. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:55,858 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-15 18:15:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-15 18:15:55,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:55,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:55,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-15 18:15:55,864 INFO L87 Difference]: Start difference. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-15 18:15:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:55,933 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-15 18:15:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-15 18:15:55,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:55,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:55,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:55,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1720 transitions. [2022-04-15 18:15:56,028 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1720 transitions. Word has length 47 [2022-04-15 18:15:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:56,028 INFO L478 AbstractCegarLoop]: Abstraction has 1192 states and 1720 transitions. [2022-04-15 18:15:56,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:56,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1192 states and 1720 transitions. [2022-04-15 18:15:59,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1720 edges. 1720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1720 transitions. [2022-04-15 18:15:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 18:15:59,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:59,061 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:59,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:15:59,061 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 1 times [2022-04-15 18:15:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930724247] [2022-04-15 18:15:59,062 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:15:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 2 times [2022-04-15 18:15:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:59,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384941020] [2022-04-15 18:15:59,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-15 18:15:59,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 18:15:59,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-15 18:15:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 18:15:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:15:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {76852#true} is VALID [2022-04-15 18:15:59,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 18:15:59,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 18:15:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 18:15:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,347 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-15 18:15:59,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:59,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:59,351 INFO L272 TraceCheckUtils]: 3: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:59,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,353 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,354 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-15 18:15:59,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {76852#true} call ULTIMATE.init(); {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:59,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-15 18:15:59,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 18:15:59,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-15 18:15:59,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {76852#true} call #t~ret1013 := main(); {76852#true} is VALID [2022-04-15 18:15:59,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {76852#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {76852#true} is VALID [2022-04-15 18:15:59,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {76852#true} call _BLAST_init(); {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:59,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {76880#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,358 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:59,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {76852#true} is VALID [2022-04-15 18:15:59,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-15 18:15:59,359 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:59,361 INFO L272 TraceCheckUtils]: 20: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:59,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-15 18:15:59,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:59,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:59,363 INFO L272 TraceCheckUtils]: 24: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:59,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:59,365 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:59,366 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-15 18:15:59,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {76853#false} assume -9223372036854775808 <= #t~ret974 && #t~ret974 <= 9223372036854775807;~status~15 := #t~ret974;havoc #t~ret974; {76853#false} is VALID [2022-04-15 18:15:59,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {76853#false} assume 0 != ~we_should_unload~0; {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {76853#false} assume !(~s~0 == ~UNLOADED~0); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {76853#false} assume !(-1 == ~status~15); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {76853#false} assume !(~s~0 != ~SKIP2~0); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {76853#false} assume 1 == ~pended~0; {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {76853#false} assume 259 != ~status~15; {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L272 TraceCheckUtils]: 45: Hoare triple {76853#false} call errorFn(); {76853#false} is VALID [2022-04-15 18:15:59,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {76853#false} assume !false; {76853#false} is VALID [2022-04-15 18:15:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:15:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384941020] [2022-04-15 18:15:59,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384941020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:15:59,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930724247] [2022-04-15 18:15:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930724247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:15:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951961970] [2022-04-15 18:15:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:59,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-15 18:15:59,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:59,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:15:59,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:59,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 18:15:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 18:15:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 18:15:59,402 INFO L87 Difference]: Start difference. First operand 1192 states and 1720 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:16:24,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:38,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:40,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:43,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:45,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:54,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:56,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:00,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:04,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:06,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:10,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:20,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:27,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:34,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:48,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:54,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:57,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:02,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-15 18:18:05,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:07,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:11,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:14,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:19,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:21,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:25,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:35,320 INFO L93 Difference]: Finished difference Result 1825 states and 2709 transitions. [2022-04-15 18:18:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 18:18:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2022-04-15 18:18:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-15 18:18:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-15 18:18:35,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 1912 transitions.