/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:13:37,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:13:37,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:13:37,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:13:37,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:13:37,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:13:37,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:13:37,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:13:37,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:13:37,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:13:37,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:13:37,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:13:37,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:13:37,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:13:37,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:13:37,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:13:37,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:13:37,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:13:37,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:13:37,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:13:37,501 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:13:37,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:13:37,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:13:37,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:13:37,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:13:37,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:13:37,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:13:37,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:13:37,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:13:37,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:13:37,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:13:37,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:13:37,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:13:37,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:13:37,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:13:37,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:13:37,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:13:37,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:13:37,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:13:37,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:13:37,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:13:37,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:13:37,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:13:37,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:13:37,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:13:37,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:13:37,523 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:13:37,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:13:37,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:13:37,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:13:37,525 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:13:37,526 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:13:37,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:13:37,526 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:13:37,526 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:13:37,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:13:37,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:13:37,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:13:37,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:13:37,735 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:13:37,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-08 08:13:37,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040b47c4f/08c342ef5a514f308b9f4e6ef8a97ee0/FLAG3630c24b0 [2022-04-08 08:13:38,088 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:13:38,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-08 08:13:38,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040b47c4f/08c342ef5a514f308b9f4e6ef8a97ee0/FLAG3630c24b0 [2022-04-08 08:13:38,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040b47c4f/08c342ef5a514f308b9f4e6ef8a97ee0 [2022-04-08 08:13:38,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:13:38,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:13:38,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:13:38,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:13:38,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:13:38,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@facbaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38, skipping insertion in model container [2022-04-08 08:13:38,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:13:38,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:13:38,704 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-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-08 08:13:38,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:13:38,711 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:13:38,751 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-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-08 08:13:38,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:13:38,766 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:13:38,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38 WrapperNode [2022-04-08 08:13:38,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:13:38,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:13:38,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:13:38,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:13:38,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:13:38,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:13:38,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:13:38,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:13:38,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (1/1) ... [2022-04-08 08:13:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:13:38,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:13:38,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:13:38,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:13:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:13:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:13:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:13:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-08 08:13:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-08 08:13:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-08 08:13:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:13:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-08 08:13:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-08 08:13:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-08 08:13:38,880 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-08 08:13:38,880 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-08 08:13:38,881 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-08 08:13:38,881 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-08 08:13:38,881 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:13:38,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:13:38,975 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:13:38,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:13:39,054 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:13:39,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-04-08 08:13:39,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-04-08 08:13:39,140 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:13:39,179 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-04-08 08:13:39,180 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-04-08 08:13:39,196 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:13:39,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-08 08:13:39,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-08 08:13:39,226 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:13:39,359 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-08 08:13:39,359 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-08 08:13:39,362 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:13:39,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:13:39,368 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 08:13:39,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:13:39 BoogieIcfgContainer [2022-04-08 08:13:39,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:13:39,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:13:39,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:13:39,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:13:39,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:13:38" (1/3) ... [2022-04-08 08:13:39,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c26df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:13:39, skipping insertion in model container [2022-04-08 08:13:39,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:13:38" (2/3) ... [2022-04-08 08:13:39,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c26df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:13:39, skipping insertion in model container [2022-04-08 08:13:39,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:13:39" (3/3) ... [2022-04-08 08:13:39,378 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-04-08 08:13:39,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:13:39,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:13:39,421 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:13:39,426 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:13:39,427 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:13:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 08:13:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:13:39,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:39,462 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-08 08:13:39,462 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-04-08 08:13:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:39,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702416968] [2022-04-08 08:13:39,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 2 times [2022-04-08 08:13:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:39,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705301029] [2022-04-08 08:13:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:39,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-08 08:13:39,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 08:13:39,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-08 08:13:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:39,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {164#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-08 08:13:39,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 08:13:39,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-08 08:13:39,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {163#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:39,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-08 08:13:39,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 08:13:39,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-08 08:13:39,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret35 := main(); {154#true} is VALID [2022-04-08 08:13:39,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {159#(= main_~status~1 0)} is VALID [2022-04-08 08:13:39,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {159#(= main_~status~1 0)} call _BLAST_init(); {164#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:39,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-08 08:13:39,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 08:13:39,878 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-08 08:13:39,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(= main_~status~1 0)} assume !(~status~1 >= 0); {155#false} is VALID [2022-04-08 08:13:39,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-08 08:13:39,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-08 08:13:39,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#false} assume ~s~0 != ~UNLOADED~0; {155#false} is VALID [2022-04-08 08:13:39,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#false} assume -1 != ~status~1; {155#false} is VALID [2022-04-08 08:13:39,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#false} assume !(~s~0 != ~SKIP2~0); {155#false} is VALID [2022-04-08 08:13:39,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#false} assume 1 == ~pended~0; {155#false} is VALID [2022-04-08 08:13:39,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#false} assume 259 != ~status~1; {155#false} is VALID [2022-04-08 08:13:39,882 INFO L272 TraceCheckUtils]: 18: Hoare triple {155#false} call errorFn(); {155#false} is VALID [2022-04-08 08:13:39,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-08 08:13:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705301029] [2022-04-08 08:13:39,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705301029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:39,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:39,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:13:39,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:39,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702416968] [2022-04-08 08:13:39,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702416968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:39,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:39,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:13:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060903898] [2022-04-08 08:13:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:39,891 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 08:13:39,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:39,895 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:13:39,923 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-08 08:13:39,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:13:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:13:39,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:13:39,948 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:13:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:40,969 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-04-08 08:13:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:13:40,970 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 08:13:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:40,971 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:13:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-08 08:13:40,996 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:13:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-08 08:13:41,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 462 transitions. [2022-04-08 08:13:41,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:41,448 INFO L225 Difference]: With dead ends: 302 [2022-04-08 08:13:41,449 INFO L226 Difference]: Without dead ends: 157 [2022-04-08 08:13:41,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:13:41,453 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:41,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-08 08:13:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-08 08:13:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:41,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:13:41,485 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:13:41,485 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:13:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:41,491 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-08 08:13:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-08 08:13:41,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:41,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:41,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-08 08:13:41,494 INFO L87 Difference]: Start difference. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-08 08:13:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:41,499 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-08 08:13:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-08 08:13:41,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:41,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:41,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:41,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:13:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-04-08 08:13:41,506 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-04-08 08:13:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:41,506 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-04-08 08:13:41,506 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), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:13:41,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 190 transitions. [2022-04-08 08:13:41,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-04-08 08:13:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:13:41,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:41,676 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:41,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:13:41,677 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-04-08 08:13:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298249874] [2022-04-08 08:13:41,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 2 times [2022-04-08 08:13:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184833111] [2022-04-08 08:13:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:41,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1365#true} is VALID [2022-04-08 08:13:41,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-08 08:13:41,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-08 08:13:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:41,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {1378#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1365#true} is VALID [2022-04-08 08:13:41,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-08 08:13:41,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-08 08:13:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:41,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {1379#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:41,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1365#true} is VALID [2022-04-08 08:13:41,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-08 08:13:41,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-08 08:13:41,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret35 := main(); {1365#true} is VALID [2022-04-08 08:13:41,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {1365#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {1365#true} is VALID [2022-04-08 08:13:41,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {1365#true} call _BLAST_init(); {1378#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:41,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1378#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1365#true} is VALID [2022-04-08 08:13:41,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-08 08:13:41,813 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-08 08:13:41,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {1365#true} is VALID [2022-04-08 08:13:41,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {1365#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {1365#true} is VALID [2022-04-08 08:13:41,814 INFO L272 TraceCheckUtils]: 12: Hoare triple {1365#true} call stub_driver_init(); {1379#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:41,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#(= ~s~0 ~NP~0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1376#(= ~s~0 ~NP~0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(= ~s~0 ~NP~0)} assume 3 == ~tmp_ndt_1~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,819 INFO L272 TraceCheckUtils]: 19: Hoare triple {1376#(= ~s~0 ~NP~0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(= ~s~0 ~NP~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {1376#(= ~s~0 ~NP~0)} assume 0 == ~irpStack__MinorFunction~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {1376#(= ~s~0 ~NP~0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-08 08:13:41,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#(= ~s~0 ~NP~0)} assume ~s~0 != ~NP~0; {1366#false} is VALID [2022-04-08 08:13:41,821 INFO L272 TraceCheckUtils]: 24: Hoare triple {1366#false} call errorFn(); {1366#false} is VALID [2022-04-08 08:13:41,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2022-04-08 08:13:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184833111] [2022-04-08 08:13:41,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184833111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:41,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:41,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:41,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298249874] [2022-04-08 08:13:41,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298249874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:41,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:41,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24795967] [2022-04-08 08:13:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:41,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2022-04-08 08:13:41,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:41,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:41,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:41,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:13:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:13:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:13:41,842 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:42,719 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-08 08:13:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:13:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2022-04-08 08:13:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-08 08:13:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-08 08:13:42,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-04-08 08:13:43,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:43,008 INFO L225 Difference]: With dead ends: 275 [2022-04-08 08:13:43,009 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 08:13:43,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:13:43,010 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 376 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:43,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 284 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 08:13:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-04-08 08:13:43,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:43,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-08 08:13:43,037 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-08 08:13:43,037 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-08 08:13:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:43,044 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-08 08:13:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-08 08:13:43,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:43,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:43,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-08 08:13:43,046 INFO L87 Difference]: Start difference. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-08 08:13:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:43,052 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-08 08:13:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-08 08:13:43,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:43,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:43,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:43,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-08 08:13:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-04-08 08:13:43,059 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-04-08 08:13:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:43,059 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-04-08 08:13:43,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:43,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 259 transitions. [2022-04-08 08:13:43,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-04-08 08:13:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:13:43,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:43,281 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] [2022-04-08 08:13:43,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:13:43,282 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-04-08 08:13:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:43,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1068533794] [2022-04-08 08:13:43,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 2 times [2022-04-08 08:13:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:43,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984497144] [2022-04-08 08:13:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:43,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2763#true} is VALID [2022-04-08 08:13:43,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-08 08:13:43,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-08 08:13:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:43,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2763#true} is VALID [2022-04-08 08:13:43,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-08 08:13:43,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-08 08:13:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:43,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {2763#true} call ULTIMATE.init(); {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:43,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2763#true} is VALID [2022-04-08 08:13:43,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-08 08:13:43,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-08 08:13:43,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret35 := main(); {2763#true} is VALID [2022-04-08 08:13:43,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {2763#true} is VALID [2022-04-08 08:13:43,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {2763#true} call _BLAST_init(); {2776#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:43,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {2776#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2763#true} is VALID [2022-04-08 08:13:43,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-08 08:13:43,391 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-08 08:13:43,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {2763#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {2763#true} is VALID [2022-04-08 08:13:43,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {2763#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {2763#true} is VALID [2022-04-08 08:13:43,392 INFO L272 TraceCheckUtils]: 12: Hoare triple {2763#true} call stub_driver_init(); {2777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:43,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {2777#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,393 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {2774#(= ~compRegistered~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {2774#(= ~compRegistered~0 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {2774#(= ~compRegistered~0 0)} assume 3 == ~tmp_ndt_1~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,394 INFO L272 TraceCheckUtils]: 19: Hoare triple {2774#(= ~compRegistered~0 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {2774#(= ~compRegistered~0 0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 == ~irpStack__MinorFunction~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {2774#(= ~compRegistered~0 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {2774#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {2774#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:43,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {2764#false} is VALID [2022-04-08 08:13:43,396 INFO L272 TraceCheckUtils]: 25: Hoare triple {2764#false} call errorFn(); {2764#false} is VALID [2022-04-08 08:13:43,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-08 08:13:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:43,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984497144] [2022-04-08 08:13:43,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984497144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:43,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:43,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:43,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:43,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1068533794] [2022-04-08 08:13:43,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1068533794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:43,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:43,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150130495] [2022-04-08 08:13:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 27 [2022-04-08 08:13:43,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:43,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:43,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:43,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:13:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:13:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:13:43,415 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:44,305 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-04-08 08:13:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:13:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 27 [2022-04-08 08:13:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-08 08:13:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-08 08:13:44,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 334 transitions. [2022-04-08 08:13:44,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:44,595 INFO L225 Difference]: With dead ends: 316 [2022-04-08 08:13:44,595 INFO L226 Difference]: Without dead ends: 254 [2022-04-08 08:13:44,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:13:44,596 INFO L913 BasicCegarLoop]: 160 mSDtfsCounter, 325 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:44,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 251 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-08 08:13:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-04-08 08:13:44,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:44,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:44,612 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:44,613 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:44,632 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-08 08:13:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-08 08:13:44,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:44,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:44,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-08 08:13:44,636 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-08 08:13:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:44,648 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-08 08:13:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-08 08:13:44,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:44,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:44,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:44,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-04-08 08:13:44,658 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-04-08 08:13:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:44,658 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-04-08 08:13:44,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:44,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 289 transitions. [2022-04-08 08:13:44,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-04-08 08:13:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 08:13:44,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:44,899 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] [2022-04-08 08:13:44,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:13:44,899 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-04-08 08:13:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:44,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516808167] [2022-04-08 08:13:44,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 2 times [2022-04-08 08:13:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:44,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318565072] [2022-04-08 08:13:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:45,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-08 08:13:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:45,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {4370#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-08 08:13:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:45,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {4371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-08 08:13:45,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:45,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-08 08:13:45,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret35 := main(); {4357#true} is VALID [2022-04-08 08:13:45,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {4357#true} is VALID [2022-04-08 08:13:45,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {4357#true} call _BLAST_init(); {4370#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:45,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {4370#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,046 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-08 08:13:45,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {4357#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {4357#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {4357#true} is VALID [2022-04-08 08:13:45,048 INFO L272 TraceCheckUtils]: 12: Hoare triple {4357#true} call stub_driver_init(); {4371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:45,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {4371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4357#true} is VALID [2022-04-08 08:13:45,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-08 08:13:45,051 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-08 08:13:45,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {4357#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {4357#true} is VALID [2022-04-08 08:13:45,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {4357#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {4357#true} is VALID [2022-04-08 08:13:45,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {4357#true} assume 3 == ~tmp_ndt_1~0; {4357#true} is VALID [2022-04-08 08:13:45,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {4357#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {4357#true} is VALID [2022-04-08 08:13:45,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {4357#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {4357#true} is VALID [2022-04-08 08:13:45,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#true} assume !(0 == ~irpStack__MinorFunction~0); {4357#true} is VALID [2022-04-08 08:13:45,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#true} assume 23 == ~irpStack__MinorFunction~0; {4357#true} is VALID [2022-04-08 08:13:45,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#true} ~devExt__SurpriseRemoved~0 := 1; {4357#true} is VALID [2022-04-08 08:13:45,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {4357#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,059 INFO L272 TraceCheckUtils]: 26: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume 0 == ~tmp_ndt_2~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:45,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {4358#false} is VALID [2022-04-08 08:13:45,062 INFO L272 TraceCheckUtils]: 35: Hoare triple {4358#false} call errorFn(); {4358#false} is VALID [2022-04-08 08:13:45,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-08 08:13:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:45,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318565072] [2022-04-08 08:13:45,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318565072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:45,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:45,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:45,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:45,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516808167] [2022-04-08 08:13:45,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516808167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:45,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:45,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:13:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024730107] [2022-04-08 08:13:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:45,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 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 37 [2022-04-08 08:13:45,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:45,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:45,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:45,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:13:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:45,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:13:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:13:45,089 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:45,783 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-04-08 08:13:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:13:45,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 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 37 [2022-04-08 08:13:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-08 08:13:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-08 08:13:45,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 214 transitions. [2022-04-08 08:13:45,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:45,974 INFO L225 Difference]: With dead ends: 220 [2022-04-08 08:13:45,974 INFO L226 Difference]: Without dead ends: 217 [2022-04-08 08:13:45,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:13:45,975 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 278 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:45,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 233 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:13:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-08 08:13:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-08 08:13:45,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:45,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:45,989 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:45,989 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:45,993 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-08 08:13:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-08 08:13:45,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:45,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:45,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-08 08:13:45,995 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-08 08:13:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:45,999 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-08 08:13:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-08 08:13:46,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:46,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:46,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:46,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-08 08:13:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-04-08 08:13:46,006 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-04-08 08:13:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:46,006 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-04-08 08:13:46,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 08:13:46,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 288 transitions. [2022-04-08 08:13:46,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-08 08:13:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 08:13:46,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:46,264 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] [2022-04-08 08:13:46,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:13:46,264 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-04-08 08:13:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888829609] [2022-04-08 08:13:46,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 2 times [2022-04-08 08:13:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851097014] [2022-04-08 08:13:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:46,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-08 08:13:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:46,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {5708#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-08 08:13:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:46,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {5709#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-08 08:13:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:46,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {5685#true} is VALID [2022-04-08 08:13:46,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,431 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-08 08:13:46,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {5685#true} call ULTIMATE.init(); {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:46,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-08 08:13:46,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {5685#true} call #t~ret35 := main(); {5685#true} is VALID [2022-04-08 08:13:46,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {5685#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {5685#true} is VALID [2022-04-08 08:13:46,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {5685#true} call _BLAST_init(); {5708#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:46,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {5685#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {5685#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {5685#true} call stub_driver_init(); {5709#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:46,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {5709#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-08 08:13:46,434 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-08 08:13:46,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {5685#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {5696#(= main_~__cil_tmp8~0 1)} is VALID [2022-04-08 08:13:46,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {5696#(= main_~__cil_tmp8~0 1)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {5685#true} is VALID [2022-04-08 08:13:46,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {5685#true} assume 3 == ~tmp_ndt_1~0; {5685#true} is VALID [2022-04-08 08:13:46,435 INFO L272 TraceCheckUtils]: 19: Hoare triple {5685#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {5685#true} is VALID [2022-04-08 08:13:46,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {5685#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {5685#true} is VALID [2022-04-08 08:13:46,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {5685#true} assume 0 == ~irpStack__MinorFunction~0; {5685#true} is VALID [2022-04-08 08:13:46,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {5685#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {5685#true} is VALID [2022-04-08 08:13:46,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {5685#true} assume !(~s~0 != ~NP~0); {5685#true} is VALID [2022-04-08 08:13:46,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {5685#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {5697#(not (= ~compRegistered~0 0))} is VALID [2022-04-08 08:13:46,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {5697#(not (= ~compRegistered~0 0))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {5697#(not (= ~compRegistered~0 0))} is VALID [2022-04-08 08:13:46,437 INFO L272 TraceCheckUtils]: 26: Hoare triple {5697#(not (= ~compRegistered~0 0))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:46,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {5685#true} is VALID [2022-04-08 08:13:46,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {5711#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {5711#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-08 08:13:46,441 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {5686#false} assume 259 == ~__cil_tmp23~0; {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L272 TraceCheckUtils]: 38: Hoare triple {5686#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {5686#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {5686#false} assume !(~s~0 == ~MPR3~0); {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {5686#false} assume !(1 == ~customIrp~0); {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {5686#false} assume ~s~0 == ~MPR3~0; {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L272 TraceCheckUtils]: 43: Hoare triple {5686#false} call errorFn(); {5686#false} is VALID [2022-04-08 08:13:46,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {5686#false} assume !false; {5686#false} is VALID [2022-04-08 08:13:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851097014] [2022-04-08 08:13:46,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851097014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:46,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:46,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:46,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:46,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888829609] [2022-04-08 08:13:46,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888829609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:46,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:46,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476175051] [2022-04-08 08:13:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:46,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-08 08:13:46,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:46,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:13:46,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:46,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:13:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:13:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:13:46,469 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:13:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:47,464 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-04-08 08:13:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:13:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-08 08:13:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:13:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-08 08:13:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:13:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-08 08:13:47,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 292 transitions. [2022-04-08 08:13:47,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:47,675 INFO L225 Difference]: With dead ends: 274 [2022-04-08 08:13:47,675 INFO L226 Difference]: Without dead ends: 208 [2022-04-08 08:13:47,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:13:47,676 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:47,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 435 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-08 08:13:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-04-08 08:13:47,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:47,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:47,689 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:47,689 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:47,692 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-08 08:13:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-08 08:13:47,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:47,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:47,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-08 08:13:47,693 INFO L87 Difference]: Start difference. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-08 08:13:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:47,697 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-08 08:13:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-08 08:13:47,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:47,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:47,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:47,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-04-08 08:13:47,701 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-04-08 08:13:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:47,701 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-04-08 08:13:47,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 08:13:47,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 250 transitions. [2022-04-08 08:13:47,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-08 08:13:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 08:13:47,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:47,911 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:47,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:13:47,911 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-04-08 08:13:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921693652] [2022-04-08 08:13:47,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 2 times [2022-04-08 08:13:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:47,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760652946] [2022-04-08 08:13:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:47,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7071#true} is VALID [2022-04-08 08:13:47,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:47,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-08 08:13:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:48,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {7095#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-08 08:13:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:48,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {7096#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-08 08:13:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 08:13:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:48,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-08 08:13:48,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-08 08:13:48,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L272 TraceCheckUtils]: 1: Hoare triple {7071#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:48,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {7071#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,043 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-08 08:13:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-08 08:13:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:48,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {7101#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {7071#true} #452#return; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {7071#true} call ULTIMATE.init(); {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:48,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-08 08:13:48,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {7071#true} call #t~ret35 := main(); {7071#true} is VALID [2022-04-08 08:13:48,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {7071#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {7071#true} is VALID [2022-04-08 08:13:48,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {7071#true} call _BLAST_init(); {7095#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:48,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {7095#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {7071#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {7071#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {7071#true} call stub_driver_init(); {7096#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:48,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {7096#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,056 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {7071#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {7071#true} assume 3 == ~tmp_ndt_1~0; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {7071#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {7071#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {7071#true} assume 0 == ~irpStack__MinorFunction~0; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {7071#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {7071#true} assume !(~s~0 != ~NP~0); {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {7071#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {7071#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L272 TraceCheckUtils]: 26: Hoare triple {7071#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {7071#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {7071#true} is VALID [2022-04-08 08:13:48,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {7071#true} assume 0 != ~compRegistered~0; {7071#true} is VALID [2022-04-08 08:13:48,060 INFO L272 TraceCheckUtils]: 29: Hoare triple {7071#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:48,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {7071#true} is VALID [2022-04-08 08:13:48,060 INFO L272 TraceCheckUtils]: 31: Hoare triple {7071#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:48,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-08 08:13:48,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,061 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-08 08:13:48,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {7071#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {7071#true} is VALID [2022-04-08 08:13:48,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-08 08:13:48,061 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-08 08:13:48,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {7071#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {7071#true} is VALID [2022-04-08 08:13:48,062 INFO L272 TraceCheckUtils]: 39: Hoare triple {7071#true} call stubMoreProcessingRequired(); {7101#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:48,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {7101#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,063 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {7071#true} #452#return; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume 0 == ~tmp_ndt_2~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} ~returnVal2~0 := 0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~NP~0); {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-08 08:13:48,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {7072#false} is VALID [2022-04-08 08:13:48,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {7072#false} assume !(~s~0 == ~SKIP1~0); {7072#false} is VALID [2022-04-08 08:13:48,064 INFO L272 TraceCheckUtils]: 49: Hoare triple {7072#false} call errorFn(); {7072#false} is VALID [2022-04-08 08:13:48,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {7072#false} assume !false; {7072#false} is VALID [2022-04-08 08:13:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:48,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760652946] [2022-04-08 08:13:48,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760652946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:48,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:48,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:13:48,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921693652] [2022-04-08 08:13:48,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921693652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:48,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:48,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:13:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45813115] [2022-04-08 08:13:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-08 08:13:48,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:48,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 08:13:48,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:48,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:13:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:48,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:13:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:13:48,096 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 08:13:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:48,808 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-04-08 08:13:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:13:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-08 08:13:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 08:13:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-08 08:13:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 08:13:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-08 08:13:48,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 270 transitions. [2022-04-08 08:13:49,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:49,016 INFO L225 Difference]: With dead ends: 258 [2022-04-08 08:13:49,016 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 08:13:49,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:13:49,017 INFO L913 BasicCegarLoop]: 160 mSDtfsCounter, 263 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:49,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 326 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:13:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 08:13:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-04-08 08:13:49,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:49,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:49,042 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:49,043 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:49,047 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-08 08:13:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-08 08:13:49,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:49,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:49,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-08 08:13:49,050 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-08 08:13:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:49,053 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-08 08:13:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-08 08:13:49,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:49,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:49,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:49,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-08 08:13:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-04-08 08:13:49,058 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-04-08 08:13:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:49,058 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-04-08 08:13:49,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 08:13:49,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 246 transitions. [2022-04-08 08:13:49,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-04-08 08:13:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:13:49,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:49,283 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:49,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:13:49,283 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-04-08 08:13:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156720063] [2022-04-08 08:13:49,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 2 times [2022-04-08 08:13:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634438966] [2022-04-08 08:13:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8397#true} is VALID [2022-04-08 08:13:49,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-08 08:13:49,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-08 08:13:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {8430#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8405#(not (= ~SKIP1~0 ~NP~0))} {8397#true} #442#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {8431#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8397#true} is VALID [2022-04-08 08:13:49,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-08 08:13:49,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8397#true} {8405#(not (= ~SKIP1~0 ~NP~0))} #444#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-08 08:13:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:49,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,497 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8397#true} is VALID [2022-04-08 08:13:49,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-08 08:13:49,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-08 08:13:49,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-08 08:13:49,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {8397#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:49,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:49,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:49,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,504 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8443#(= ~SKIP1~0 ~NP~0)} {8405#(not (= ~SKIP1~0 ~NP~0))} #446#return; {8398#false} is VALID [2022-04-08 08:13:49,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {8397#true} call ULTIMATE.init(); {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:49,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8397#true} is VALID [2022-04-08 08:13:49,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-08 08:13:49,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-08 08:13:49,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {8397#true} call #t~ret35 := main(); {8397#true} is VALID [2022-04-08 08:13:49,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {8397#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {8397#true} is VALID [2022-04-08 08:13:49,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {8397#true} call _BLAST_init(); {8430#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:49,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {8430#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,512 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8405#(not (= ~SKIP1~0 ~NP~0))} {8397#true} #442#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,513 INFO L272 TraceCheckUtils]: 12: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {8431#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:49,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {8431#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8397#true} is VALID [2022-04-08 08:13:49,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-08 08:13:49,513 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8397#true} {8405#(not (= ~SKIP1~0 ~NP~0))} #444#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume 3 == ~tmp_ndt_1~0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 08:13:49,515 INFO L272 TraceCheckUtils]: 19: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:49,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8397#true} is VALID [2022-04-08 08:13:49,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-08 08:13:49,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-08 08:13:49,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-08 08:13:49,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {8397#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:49,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 08:13:49,516 INFO L272 TraceCheckUtils]: 26: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:49,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:49,519 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 08:13:49,521 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8443#(= ~SKIP1~0 ~NP~0)} {8405#(not (= ~SKIP1~0 ~NP~0))} #446#return; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {8398#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {8398#false} assume ~s~0 != ~UNLOADED~0; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {8398#false} assume -1 != ~status~1; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {8398#false} assume !(~s~0 != ~SKIP2~0); {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {8398#false} assume 1 == ~pended~0; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {8398#false} assume 259 != ~status~1; {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L272 TraceCheckUtils]: 48: Hoare triple {8398#false} call errorFn(); {8398#false} is VALID [2022-04-08 08:13:49,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-04-08 08:13:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:49,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634438966] [2022-04-08 08:13:49,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634438966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:49,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:49,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:49,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156720063] [2022-04-08 08:13:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156720063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:49,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960753417] [2022-04-08 08:13:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 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 50 [2022-04-08 08:13:49,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:49,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:13:49,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:49,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:13:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:49,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:13:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:49,557 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:13:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:51,638 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-04-08 08:13:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:13:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 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 50 [2022-04-08 08:13:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:13:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-08 08:13:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:13:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-08 08:13:51,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 277 transitions. [2022-04-08 08:13:51,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:51,867 INFO L225 Difference]: With dead ends: 234 [2022-04-08 08:13:51,868 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 08:13:51,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-08 08:13:51,868 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 568 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:51,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 526 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 08:13:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 08:13:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-04-08 08:13:51,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:51,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-08 08:13:51,881 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-08 08:13:51,882 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-08 08:13:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:51,885 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-08 08:13:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-08 08:13:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:51,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-08 08:13:51,886 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-08 08:13:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:51,889 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-08 08:13:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-08 08:13:51,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:51,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:51,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:51,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-08 08:13:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-04-08 08:13:51,892 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-04-08 08:13:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:51,893 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-04-08 08:13:51,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 08:13:51,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 244 transitions. [2022-04-08 08:13:52,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-04-08 08:13:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 08:13:52,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:52,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:52,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:13:52,118 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-04-08 08:13:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942202107] [2022-04-08 08:13:52,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 2 times [2022-04-08 08:13:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:52,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029008863] [2022-04-08 08:13:52,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:52,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-08 08:13:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {9770#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-08 08:13:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {9771#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-08 08:13:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:52,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-08 08:13:52,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-08 08:13:52,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-08 08:13:52,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-08 08:13:52,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-08 08:13:52,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-08 08:13:52,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-08 08:13:52,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {9733#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-08 08:13:52,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {9733#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {9733#true} is VALID [2022-04-08 08:13:52,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-08 08:13:52,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,300 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {9733#true} call ULTIMATE.init(); {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:52,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-08 08:13:52,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {9733#true} call #t~ret35 := main(); {9733#true} is VALID [2022-04-08 08:13:52,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {9733#true} is VALID [2022-04-08 08:13:52,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {9733#true} call _BLAST_init(); {9770#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:52,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {9770#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,302 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-08 08:13:52,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {9733#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {9733#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {9733#true} is VALID [2022-04-08 08:13:52,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {9733#true} call stub_driver_init(); {9771#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:52,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {9771#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-08 08:13:52,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {9744#(= ~pended~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {9745#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} is VALID [2022-04-08 08:13:52,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {9745#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {9746#(not (= ~pended~0 1))} assume 3 == ~tmp_ndt_1~0; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {9746#(not (= ~pended~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:52,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9733#true} is VALID [2022-04-08 08:13:52,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {9733#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L272 TraceCheckUtils]: 26: Hoare triple {9733#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-08 08:13:52,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {9733#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-08 08:13:52,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-08 08:13:52,308 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {9746#(not (= ~pended~0 1))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {9746#(not (= ~pended~0 1))} assume ~s~0 != ~UNLOADED~0; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {9746#(not (= ~pended~0 1))} assume -1 != ~status~1; {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {9746#(not (= ~pended~0 1))} assume !(~s~0 != ~SKIP2~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-08 08:13:52,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {9746#(not (= ~pended~0 1))} assume 1 == ~pended~0; {9734#false} is VALID [2022-04-08 08:13:52,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {9734#false} assume 259 != ~status~1; {9734#false} is VALID [2022-04-08 08:13:52,309 INFO L272 TraceCheckUtils]: 50: Hoare triple {9734#false} call errorFn(); {9734#false} is VALID [2022-04-08 08:13:52,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {9734#false} assume !false; {9734#false} is VALID [2022-04-08 08:13:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029008863] [2022-04-08 08:13:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029008863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:52,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:52,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:13:52,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942202107] [2022-04-08 08:13:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942202107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:13:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244732776] [2022-04-08 08:13:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-08 08:13:52,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:52,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:13:52,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:52,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:13:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:13:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:13:52,341 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:13:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:53,324 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-04-08 08:13:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:13:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-08 08:13:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:13:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-08 08:13:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:13:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-08 08:13:53,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-04-08 08:13:53,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:53,520 INFO L225 Difference]: With dead ends: 203 [2022-04-08 08:13:53,520 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 08:13:53,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:53,521 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 358 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:53,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 240 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 08:13:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 08:13:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 08:13:53,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:53,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:53,529 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:53,530 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:53,532 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-08 08:13:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-08 08:13:53,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:53,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:53,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:53,538 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:53,539 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-08 08:13:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-08 08:13:53,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:53,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:53,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:53,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-04-08 08:13:53,540 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-04-08 08:13:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:53,541 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-04-08 08:13:53,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 08:13:53,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 102 transitions. [2022-04-08 08:13:53,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-08 08:13:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 08:13:53,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:53,633 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:53,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:13:53,633 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-04-08 08:13:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:53,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880196444] [2022-04-08 08:13:53,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 2 times [2022-04-08 08:13:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:53,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092593144] [2022-04-08 08:13:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10562#true} is VALID [2022-04-08 08:13:53,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-08 08:13:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {10598#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {10562#true} #442#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {10599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10562#true} is VALID [2022-04-08 08:13:53,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-08 08:13:53,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-08 08:13:53,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-08 08:13:53,803 INFO L272 TraceCheckUtils]: 1: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:53,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-08 08:13:53,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,804 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-08 08:13:53,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-08 08:13:53,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,804 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-08 08:13:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:53,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10562#true} is VALID [2022-04-08 08:13:53,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-08 08:13:53,818 INFO L272 TraceCheckUtils]: 2: Hoare triple {10562#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:53,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-08 08:13:53,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:53,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-08 08:13:53,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,819 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-08 08:13:53,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-08 08:13:53,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-08 08:13:53,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {10562#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10562#true} is VALID [2022-04-08 08:13:53,820 INFO L272 TraceCheckUtils]: 12: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:53,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,821 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,824 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {10563#false} is VALID [2022-04-08 08:13:53,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {10562#true} call ULTIMATE.init(); {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:53,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10562#true} is VALID [2022-04-08 08:13:53,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-08 08:13:53,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {10562#true} call #t~ret35 := main(); {10562#true} is VALID [2022-04-08 08:13:53,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {10562#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {10562#true} is VALID [2022-04-08 08:13:53,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {10562#true} call _BLAST_init(); {10598#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:53,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {10598#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,828 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {10562#true} #442#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call stub_driver_init(); {10599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:53,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {10599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10562#true} is VALID [2022-04-08 08:13:53,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10562#true} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 3 == ~tmp_ndt_1~0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,831 INFO L272 TraceCheckUtils]: 19: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irpStack__MinorFunction~0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~s~0 != ~NP~0); {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-08 08:13:53,833 INFO L272 TraceCheckUtils]: 26: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:53,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10562#true} is VALID [2022-04-08 08:13:53,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-08 08:13:53,834 INFO L272 TraceCheckUtils]: 29: Hoare triple {10562#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:53,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L272 TraceCheckUtils]: 31: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:53,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-08 08:13:53,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {10562#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10562#true} is VALID [2022-04-08 08:13:53,836 INFO L272 TraceCheckUtils]: 39: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:53,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-08 08:13:53,837 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-08 08:13:53,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-08 08:13:53,839 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {10563#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {10563#false} assume 259 == ~__cil_tmp23~0; {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L272 TraceCheckUtils]: 52: Hoare triple {10563#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {10563#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {10563#false} assume !(~s~0 == ~MPR3~0); {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {10563#false} assume !(1 == ~customIrp~0); {10563#false} is VALID [2022-04-08 08:13:53,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {10563#false} assume ~s~0 == ~MPR3~0; {10563#false} is VALID [2022-04-08 08:13:53,840 INFO L272 TraceCheckUtils]: 57: Hoare triple {10563#false} call errorFn(); {10563#false} is VALID [2022-04-08 08:13:53,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {10563#false} assume !false; {10563#false} is VALID [2022-04-08 08:13:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:53,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092593144] [2022-04-08 08:13:53,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092593144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:53,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:53,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:53,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:53,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880196444] [2022-04-08 08:13:53,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880196444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:53,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:53,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529143016] [2022-04-08 08:13:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:53,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-08 08:13:53,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:53,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:53,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:53,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:13:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:53,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:13:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:53,878 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:54,744 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-08 08:13:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:13:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-08 08:13:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-08 08:13:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-08 08:13:54,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2022-04-08 08:13:54,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:54,856 INFO L225 Difference]: With dead ends: 119 [2022-04-08 08:13:54,856 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 08:13:54,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:13:54,856 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 119 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:54,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 240 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 08:13:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 08:13:54,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:54,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:54,906 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:54,906 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:54,907 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-08 08:13:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-08 08:13:54,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:54,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:54,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:54,908 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:54,909 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-08 08:13:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-08 08:13:54,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:54,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:54,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:54,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-04-08 08:13:54,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-04-08 08:13:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:54,911 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-04-08 08:13:54,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:54,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 101 transitions. [2022-04-08 08:13:55,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-08 08:13:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 08:13:55,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:55,031 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:55,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:13:55,031 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-04-08 08:13:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:55,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198916661] [2022-04-08 08:13:55,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 2 times [2022-04-08 08:13:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002151729] [2022-04-08 08:13:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-08 08:13:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {11277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-08 08:13:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {11278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-08 08:13:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-08 08:13:55,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-08 08:13:55,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-08 08:13:55,152 INFO L272 TraceCheckUtils]: 1: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:55,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-08 08:13:55,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,153 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-08 08:13:55,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-08 08:13:55,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,153 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-08 08:13:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-08 08:13:55,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-08 08:13:55,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11240#true} is VALID [2022-04-08 08:13:55,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-08 08:13:55,160 INFO L272 TraceCheckUtils]: 2: Hoare triple {11240#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:55,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:55,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-08 08:13:55,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {11240#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {11240#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11241#false} is VALID [2022-04-08 08:13:55,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-08 08:13:55,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-08 08:13:55,163 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-08 08:13:55,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {11240#true} call ULTIMATE.init(); {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:55,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-08 08:13:55,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {11240#true} call #t~ret35 := main(); {11240#true} is VALID [2022-04-08 08:13:55,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {11240#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {11240#true} is VALID [2022-04-08 08:13:55,166 INFO L272 TraceCheckUtils]: 6: Hoare triple {11240#true} call _BLAST_init(); {11277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:55,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {11277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,166 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-08 08:13:55,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {11240#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {11240#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L272 TraceCheckUtils]: 12: Hoare triple {11240#true} call stub_driver_init(); {11278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {11278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {11240#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {11240#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} assume 3 == ~tmp_ndt_1~0; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {11240#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {11240#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {11240#true} assume 0 == ~irpStack__MinorFunction~0; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {11240#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {11240#true} assume !(~s~0 != ~NP~0); {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {11240#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11240#true} is VALID [2022-04-08 08:13:55,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {11240#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {11240#true} is VALID [2022-04-08 08:13:55,168 INFO L272 TraceCheckUtils]: 26: Hoare triple {11240#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:55,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11240#true} is VALID [2022-04-08 08:13:55,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-08 08:13:55,168 INFO L272 TraceCheckUtils]: 29: Hoare triple {11240#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L272 TraceCheckUtils]: 31: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-08 08:13:55,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {11240#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L272 TraceCheckUtils]: 39: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:55,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {11240#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-08 08:13:55,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {11241#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {11241#false} assume 259 == ~__cil_tmp23~0; {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L272 TraceCheckUtils]: 54: Hoare triple {11241#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {11241#false} is VALID [2022-04-08 08:13:55,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {11241#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {11241#false} assume !(~s~0 == ~MPR3~0); {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {11241#false} assume !(1 == ~customIrp~0); {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {11241#false} assume ~s~0 == ~MPR3~0; {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L272 TraceCheckUtils]: 59: Hoare triple {11241#false} call errorFn(); {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {11241#false} assume !false; {11241#false} is VALID [2022-04-08 08:13:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002151729] [2022-04-08 08:13:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002151729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:55,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:55,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198916661] [2022-04-08 08:13:55,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198916661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:55,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:55,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082229621] [2022-04-08 08:13:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:55,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-08 08:13:55,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:55,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:55,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:55,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:13:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:13:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:13:55,209 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:55,591 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-08 08:13:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:13:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-08 08:13:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-08 08:13:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-08 08:13:55,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-04-08 08:13:55,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:55,697 INFO L225 Difference]: With dead ends: 125 [2022-04-08 08:13:55,698 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 08:13:55,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:13:55,698 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:55,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 177 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:13:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 08:13:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-04-08 08:13:55,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:55,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:55,756 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:55,756 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:55,758 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-08 08:13:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-08 08:13:55,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:55,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:55,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-08 08:13:55,758 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-08 08:13:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:55,759 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-08 08:13:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-08 08:13:55,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:55,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:55,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:55,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-04-08 08:13:55,761 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-04-08 08:13:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:55,761 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-04-08 08:13:55,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:55,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 104 transitions. [2022-04-08 08:13:55,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-04-08 08:13:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 08:13:55,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:55,877 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:55,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:13:55,877 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-04-08 08:13:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:55,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677962181] [2022-04-08 08:13:55,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 2 times [2022-04-08 08:13:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639119429] [2022-04-08 08:13:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11931#true} is VALID [2022-04-08 08:13:55,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:55,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-08 08:13:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {11970#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11931#true} is VALID [2022-04-08 08:13:55,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:55,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-08 08:13:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:55,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {11971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11931#true} is VALID [2022-04-08 08:13:55,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:55,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-08 08:13:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:56,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-08 08:13:56,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L272 TraceCheckUtils]: 1: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:56,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,038 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-08 08:13:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:56,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-08 08:13:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-08 08:13:56,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11931#true} is VALID [2022-04-08 08:13:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-08 08:13:56,048 INFO L272 TraceCheckUtils]: 2: Hoare triple {11931#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:56,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-08 08:13:56,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:56,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-08 08:13:56,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L272 TraceCheckUtils]: 12: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11931#true} is VALID [2022-04-08 08:13:56,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-08 08:13:56,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-08 08:13:56,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-08 08:13:56,052 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11985#(<= |IofCallDriver_#res| 0)} {11931#true} #470#return; {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-08 08:13:56,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {11931#true} call ULTIMATE.init(); {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:56,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11931#true} is VALID [2022-04-08 08:13:56,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-08 08:13:56,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {11931#true} call #t~ret35 := main(); {11931#true} is VALID [2022-04-08 08:13:56,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {11931#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {11931#true} is VALID [2022-04-08 08:13:56,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {11931#true} call _BLAST_init(); {11970#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:56,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {11970#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11931#true} is VALID [2022-04-08 08:13:56,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,054 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-08 08:13:56,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {11931#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {11931#true} is VALID [2022-04-08 08:13:56,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L272 TraceCheckUtils]: 12: Hoare triple {11931#true} call stub_driver_init(); {11971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} assume 3 == ~tmp_ndt_1~0; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L272 TraceCheckUtils]: 19: Hoare triple {11931#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {11931#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {11931#true} assume 0 == ~irpStack__MinorFunction~0; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {11931#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {11931#true} assume !(~s~0 != ~NP~0); {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11931#true} is VALID [2022-04-08 08:13:56,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {11931#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {11931#true} is VALID [2022-04-08 08:13:56,056 INFO L272 TraceCheckUtils]: 26: Hoare triple {11931#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:56,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11931#true} is VALID [2022-04-08 08:13:56,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L272 TraceCheckUtils]: 29: Hoare triple {11931#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:56,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L272 TraceCheckUtils]: 31: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:56,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-08 08:13:56,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {11931#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L272 TraceCheckUtils]: 39: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {11931#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-08 08:13:56,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-08 08:13:56,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-08 08:13:56,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-08 08:13:56,060 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11985#(<= |IofCallDriver_#res| 0)} {11931#true} #470#return; {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-08 08:13:56,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {11968#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {11968#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} assume 259 == ~__cil_tmp23~0; {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L272 TraceCheckUtils]: 54: Hoare triple {11932#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {11932#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {11932#false} assume !(~s~0 == ~MPR3~0); {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {11932#false} assume !(1 == ~customIrp~0); {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {11932#false} assume ~s~0 == ~MPR3~0; {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L272 TraceCheckUtils]: 59: Hoare triple {11932#false} call errorFn(); {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {11932#false} assume !false; {11932#false} is VALID [2022-04-08 08:13:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:56,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:56,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639119429] [2022-04-08 08:13:56,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639119429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:56,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:56,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:56,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:56,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677962181] [2022-04-08 08:13:56,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677962181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:56,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:56,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693069549] [2022-04-08 08:13:56,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-08 08:13:56,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:56,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:56,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:56,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:13:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:56,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:13:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:56,101 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:56,738 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-04-08 08:13:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:13:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-08 08:13:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-08 08:13:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-08 08:13:56,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-08 08:13:56,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:56,842 INFO L225 Difference]: With dead ends: 112 [2022-04-08 08:13:56,842 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 08:13:56,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:13:56,842 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 60 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:56,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 334 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:13:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 08:13:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-08 08:13:56,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:56,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:56,887 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:56,887 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:56,888 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-08 08:13:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-08 08:13:56,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:56,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:56,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-08 08:13:56,889 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-08 08:13:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:56,890 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-08 08:13:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-08 08:13:56,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:56,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:56,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:56,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-04-08 08:13:56,891 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-04-08 08:13:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:56,891 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-04-08 08:13:56,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:56,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 97 transitions. [2022-04-08 08:13:56,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 08:13:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 08:13:56,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:56,994 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:56,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:13:56,994 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-04-08 08:13:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:56,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79147725] [2022-04-08 08:13:56,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 2 times [2022-04-08 08:13:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282417184] [2022-04-08 08:13:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-08 08:13:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-08 08:13:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {12623#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-08 08:13:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-08 08:13:57,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-08 08:13:57,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L272 TraceCheckUtils]: 1: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:57,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,121 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-08 08:13:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-08 08:13:57,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-08 08:13:57,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12583#true} is VALID [2022-04-08 08:13:57,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-08 08:13:57,129 INFO L272 TraceCheckUtils]: 2: Hoare triple {12583#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:57,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:57,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {12583#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12583#true} is VALID [2022-04-08 08:13:57,130 INFO L272 TraceCheckUtils]: 12: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {12583#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {12583#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {12583#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,131 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-08 08:13:57,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {12583#true} call ULTIMATE.init(); {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:57,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-08 08:13:57,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {12583#true} call #t~ret35 := main(); {12583#true} is VALID [2022-04-08 08:13:57,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {12583#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {12583#true} call _BLAST_init(); {12622#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:57,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {12583#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {12583#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {12583#true} is VALID [2022-04-08 08:13:57,134 INFO L272 TraceCheckUtils]: 12: Hoare triple {12583#true} call stub_driver_init(); {12623#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:57,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {12623#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {12583#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {12583#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume 3 == ~tmp_ndt_1~0; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {12583#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {12583#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume 0 == ~irpStack__MinorFunction~0; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {12583#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} assume !(~s~0 != ~NP~0); {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {12583#true} is VALID [2022-04-08 08:13:57,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {12583#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {12583#true} is VALID [2022-04-08 08:13:57,136 INFO L272 TraceCheckUtils]: 26: Hoare triple {12583#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:57,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12583#true} is VALID [2022-04-08 08:13:57,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-08 08:13:57,136 INFO L272 TraceCheckUtils]: 29: Hoare triple {12583#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:57,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L272 TraceCheckUtils]: 31: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:57,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {12583#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12583#true} is VALID [2022-04-08 08:13:57,137 INFO L272 TraceCheckUtils]: 39: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {12583#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {12583#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {12583#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {12583#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {12583#true} assume 259 == ~__cil_tmp23~0; {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L272 TraceCheckUtils]: 55: Hoare triple {12583#true} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {12583#true} is VALID [2022-04-08 08:13:57,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {12583#true} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {12583#true} is VALID [2022-04-08 08:13:57,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {12583#true} assume !(~s~0 == ~MPR3~0); {12620#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:13:57,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {12620#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {12620#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 08:13:57,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {12620#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {12584#false} is VALID [2022-04-08 08:13:57,139 INFO L272 TraceCheckUtils]: 60: Hoare triple {12584#false} call errorFn(); {12584#false} is VALID [2022-04-08 08:13:57,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {12584#false} assume !false; {12584#false} is VALID [2022-04-08 08:13:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:57,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282417184] [2022-04-08 08:13:57,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282417184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:57,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:57,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:57,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:57,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79147725] [2022-04-08 08:13:57,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79147725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:57,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:57,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971616452] [2022-04-08 08:13:57,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:57,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-08 08:13:57,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:57,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:57,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:57,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:13:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:13:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:13:57,175 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:57,606 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-08 08:13:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:13:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-08 08:13:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-08 08:13:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-08 08:13:57,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2022-04-08 08:13:57,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:57,697 INFO L225 Difference]: With dead ends: 105 [2022-04-08 08:13:57,697 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 08:13:57,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:13:57,697 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 53 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:57,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 181 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:13:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 08:13:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-04-08 08:13:57,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:57,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:57,745 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:57,745 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:57,746 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-08 08:13:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-08 08:13:57,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:57,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:57,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-08 08:13:57,747 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-08 08:13:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:57,748 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-08 08:13:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-08 08:13:57,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:57,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:57,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:57,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-08 08:13:57,750 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-04-08 08:13:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:57,750 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-08 08:13:57,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:57,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-08 08:13:57,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 08:13:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 08:13:57,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:57,868 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:57,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:13:57,868 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-04-08 08:13:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:57,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859173742] [2022-04-08 08:13:57,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 2 times [2022-04-08 08:13:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:57,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354155273] [2022-04-08 08:13:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13237#true} is VALID [2022-04-08 08:13:57,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:57,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-08 08:13:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {13277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13237#true} is VALID [2022-04-08 08:13:57,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:57,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-08 08:13:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:57,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {13278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13237#true} is VALID [2022-04-08 08:13:57,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:57,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-08 08:13:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:58,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L272 TraceCheckUtils]: 1: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:58,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-08 08:13:58,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-08 08:13:58,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,029 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-08 08:13:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:58,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-08 08:13:58,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-08 08:13:58,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13237#true} is VALID [2022-04-08 08:13:58,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L272 TraceCheckUtils]: 2: Hoare triple {13237#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:58,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:58,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-08 08:13:58,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {13237#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-08 08:13:58,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-08 08:13:58,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-08 08:13:58,047 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-08 08:13:58,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {13237#true} call ULTIMATE.init(); {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:58,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13237#true} is VALID [2022-04-08 08:13:58,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-08 08:13:58,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {13237#true} call #t~ret35 := main(); {13237#true} is VALID [2022-04-08 08:13:58,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {13237#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {13237#true} is VALID [2022-04-08 08:13:58,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {13237#true} call _BLAST_init(); {13277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:58,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {13277#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13237#true} is VALID [2022-04-08 08:13:58,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {13237#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {13237#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L272 TraceCheckUtils]: 12: Hoare triple {13237#true} call stub_driver_init(); {13278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {13278#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {13237#true} is VALID [2022-04-08 08:13:58,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume 3 == ~tmp_ndt_1~0; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {13237#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {13237#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {13237#true} assume 0 == ~irpStack__MinorFunction~0; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {13237#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {13237#true} assume !(~s~0 != ~NP~0); {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {13237#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {13237#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {13237#true} is VALID [2022-04-08 08:13:58,051 INFO L272 TraceCheckUtils]: 26: Hoare triple {13237#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:58,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13237#true} is VALID [2022-04-08 08:13:58,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-08 08:13:58,052 INFO L272 TraceCheckUtils]: 29: Hoare triple {13237#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:58,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-08 08:13:58,052 INFO L272 TraceCheckUtils]: 31: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {13237#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L272 TraceCheckUtils]: 39: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {13237#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {13237#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13237#true} is VALID [2022-04-08 08:13:58,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-08 08:13:58,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-08 08:13:58,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-08 08:13:58,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-08 08:13:58,055 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {13275#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {13275#(<= 259 KbFilter_PnP_~status~0)} assume !(259 == ~__cil_tmp23~0); {13275#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {13275#(<= 259 KbFilter_PnP_~status~0)} assume !(~status~0 >= 0); {13238#false} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {13238#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {13238#false} is VALID [2022-04-08 08:13:58,056 INFO L272 TraceCheckUtils]: 57: Hoare triple {13238#false} call IofCompleteRequest(~Irp, 0); {13238#false} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {13238#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {13238#false} is VALID [2022-04-08 08:13:58,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {13238#false} assume !(~s~0 == ~NP~0); {13238#false} is VALID [2022-04-08 08:13:58,057 INFO L272 TraceCheckUtils]: 60: Hoare triple {13238#false} call errorFn(); {13238#false} is VALID [2022-04-08 08:13:58,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {13238#false} assume !false; {13238#false} is VALID [2022-04-08 08:13:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:58,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:58,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354155273] [2022-04-08 08:13:58,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354155273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:58,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:58,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:58,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:58,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859173742] [2022-04-08 08:13:58,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859173742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:58,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:58,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:13:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663709566] [2022-04-08 08:13:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:58,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-08 08:13:58,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:58,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:58,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:58,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:13:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:13:58,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:58,092 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:58,802 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-04-08 08:13:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:13:58,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-08 08:13:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-08 08:13:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-08 08:13:58,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-08 08:13:58,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:58,888 INFO L225 Difference]: With dead ends: 98 [2022-04-08 08:13:58,888 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 08:13:58,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:13:58,888 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 85 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:58,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 267 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:13:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 08:13:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 08:13:58,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:58,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:58,961 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:58,961 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:58,962 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-08 08:13:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-08 08:13:58,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:58,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:58,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:58,962 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-08 08:13:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:58,963 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-08 08:13:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-08 08:13:58,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:58,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:58,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:58,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 08:13:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-04-08 08:13:58,965 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-04-08 08:13:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:58,965 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-04-08 08:13:58,965 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:13:58,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 97 transitions. [2022-04-08 08:13:59,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-08 08:13:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:13:59,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:59,072 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:59,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:13:59,072 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-04-08 08:13:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:59,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778810453] [2022-04-08 08:13:59,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 2 times [2022-04-08 08:13:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:59,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969489853] [2022-04-08 08:13:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-08 08:13:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {13901#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-08 08:13:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {13902#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-08 08:13:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-08 08:13:59,203 INFO L272 TraceCheckUtils]: 1: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,204 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,206 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-08 08:13:59,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13862#true} is VALID [2022-04-08 08:13:59,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-08 08:13:59,213 INFO L272 TraceCheckUtils]: 2: Hoare triple {13862#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-08 08:13:59,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,215 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,216 INFO L272 TraceCheckUtils]: 12: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:59,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-08 08:13:59,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {13899#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,219 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {13862#true} call ULTIMATE.init(); {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:59,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-08 08:13:59,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {13862#true} call #t~ret35 := main(); {13862#true} is VALID [2022-04-08 08:13:59,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {13862#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {13862#true} is VALID [2022-04-08 08:13:59,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {13862#true} call _BLAST_init(); {13901#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {13901#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,222 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-08 08:13:59,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {13862#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L272 TraceCheckUtils]: 12: Hoare triple {13862#true} call stub_driver_init(); {13902#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {13902#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {13862#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {13862#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {13862#true} assume 3 == ~tmp_ndt_1~0; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L272 TraceCheckUtils]: 19: Hoare triple {13862#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {13862#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {13862#true} assume 0 == ~irpStack__MinorFunction~0; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {13862#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {13862#true} assume !(~s~0 != ~NP~0); {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {13862#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13862#true} is VALID [2022-04-08 08:13:59,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {13862#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {13862#true} is VALID [2022-04-08 08:13:59,224 INFO L272 TraceCheckUtils]: 26: Hoare triple {13862#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13862#true} is VALID [2022-04-08 08:13:59,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-08 08:13:59,224 INFO L272 TraceCheckUtils]: 29: Hoare triple {13862#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-08 08:13:59,225 INFO L272 TraceCheckUtils]: 31: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,226 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,227 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,228 INFO L272 TraceCheckUtils]: 39: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:59,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-08 08:13:59,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-08 08:13:59,228 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {13899#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,231 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~__cil_tmp23~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,232 INFO L272 TraceCheckUtils]: 55: Hoare triple {13899#(= ~setEventCalled~0 1)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {13899#(= ~setEventCalled~0 1)} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-08 08:13:59,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {13863#false} is VALID [2022-04-08 08:13:59,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {13863#false} assume !(1 == ~customIrp~0); {13863#false} is VALID [2022-04-08 08:13:59,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {13863#false} assume ~s~0 == ~MPR3~0; {13863#false} is VALID [2022-04-08 08:13:59,233 INFO L272 TraceCheckUtils]: 61: Hoare triple {13863#false} call errorFn(); {13863#false} is VALID [2022-04-08 08:13:59,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {13863#false} assume !false; {13863#false} is VALID [2022-04-08 08:13:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:59,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969489853] [2022-04-08 08:13:59,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969489853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:59,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:59,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:59,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:59,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778810453] [2022-04-08 08:13:59,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778810453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:59,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:59,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359541904] [2022-04-08 08:13:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-08 08:13:59,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:59,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:59,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:59,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:13:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:13:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:13:59,271 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:59,613 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-04-08 08:13:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:13:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-08 08:13:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:13:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-08 08:13:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-08 08:13:59,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-08 08:13:59,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:59,694 INFO L225 Difference]: With dead ends: 107 [2022-04-08 08:13:59,694 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 08:13:59,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:13:59,695 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 72 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:13:59,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 139 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:13:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 08:13:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 08:13:59,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:13:59,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 08:13:59,738 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 08:13:59,739 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 08:13:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:59,739 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-08 08:13:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-08 08:13:59,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:59,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:59,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-08 08:13:59,740 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-08 08:13:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:13:59,741 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-08 08:13:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-08 08:13:59,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:13:59,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:13:59,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:13:59,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:13:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 08:13:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-08 08:13:59,742 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-04-08 08:13:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:13:59,742 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-08 08:13:59,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:13:59,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-08 08:13:59,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-08 08:13:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:13:59,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:13:59,833 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:13:59,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:13:59,833 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:13:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:13:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-04-08 08:13:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:59,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1279934957] [2022-04-08 08:13:59,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:13:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 2 times [2022-04-08 08:13:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:13:59,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57581345] [2022-04-08 08:13:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:13:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:13:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:13:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-08 08:13:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:13:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {14485#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-08 08:13:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {14486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:13:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:13:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:13:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-08 08:13:59,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-08 08:13:59,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L272 TraceCheckUtils]: 1: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-08 08:13:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:13:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:59,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-08 08:13:59,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-08 08:13:59,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {14446#true} is VALID [2022-04-08 08:13:59,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-08 08:13:59,968 INFO L272 TraceCheckUtils]: 2: Hoare triple {14446#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-08 08:13:59,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {14446#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L272 TraceCheckUtils]: 12: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {14446#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {14446#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {14446#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-08 08:13:59,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,971 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {14446#true} call ULTIMATE.init(); {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:13:59,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-08 08:13:59,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {14446#true} call #t~ret35 := main(); {14446#true} is VALID [2022-04-08 08:13:59,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {14446#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {14446#true} is VALID [2022-04-08 08:13:59,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {14446#true} call _BLAST_init(); {14485#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {14485#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,974 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-08 08:13:59,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {14446#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {14446#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,975 INFO L272 TraceCheckUtils]: 12: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call stub_driver_init(); {14486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {14486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14446#true} is VALID [2022-04-08 08:13:59,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume 3 == ~tmp_ndt_1~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,976 INFO L272 TraceCheckUtils]: 19: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume 0 == ~irpStack__MinorFunction~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(~s~0 != ~NP~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,979 INFO L272 TraceCheckUtils]: 26: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:13:59,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {14446#true} is VALID [2022-04-08 08:13:59,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-08 08:13:59,979 INFO L272 TraceCheckUtils]: 29: Hoare triple {14446#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L272 TraceCheckUtils]: 31: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-08 08:13:59,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {14446#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L272 TraceCheckUtils]: 39: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {14446#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {14446#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {14446#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-08 08:13:59,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-08 08:13:59,982 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(259 == ~__cil_tmp23~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~0 >= 0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {14447#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L272 TraceCheckUtils]: 58: Hoare triple {14447#false} call IofCompleteRequest(~Irp, 0); {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {14447#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {14447#false} assume !(~s~0 == ~NP~0); {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L272 TraceCheckUtils]: 61: Hoare triple {14447#false} call errorFn(); {14447#false} is VALID [2022-04-08 08:13:59,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {14447#false} assume !false; {14447#false} is VALID [2022-04-08 08:13:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:13:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:59,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57581345] [2022-04-08 08:13:59,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57581345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:59,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:59,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:59,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:59,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1279934957] [2022-04-08 08:13:59,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1279934957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:59,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:59,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:13:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82084499] [2022-04-08 08:13:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:59,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-08 08:13:59,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:59,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:14:00,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:00,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:14:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:14:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:14:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:14:00,025 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:14:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:00,649 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-04-08 08:14:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:14:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-08 08:14:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:14:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:14:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-08 08:14:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:14:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-08 08:14:00,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2022-04-08 08:14:00,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:00,771 INFO L225 Difference]: With dead ends: 141 [2022-04-08 08:14:00,771 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 08:14:00,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:14:00,771 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:14:00,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 160 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:14:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 08:14:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-08 08:14:00,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:14:00,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:00,888 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:00,888 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:00,890 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-08 08:14:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-08 08:14:00,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:00,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:00,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-08 08:14:00,890 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-08 08:14:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:00,892 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-08 08:14:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-08 08:14:00,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:00,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:00,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:14:00,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:14:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-04-08 08:14:00,894 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-04-08 08:14:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:14:00,895 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-04-08 08:14:00,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 08:14:00,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 138 transitions. [2022-04-08 08:14:01,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-04-08 08:14:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:14:01,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:14:01,049 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:14:01,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:14:01,049 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:14:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:14:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-04-08 08:14:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:14:01,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541549563] [2022-04-08 08:14:01,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:14:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 2 times [2022-04-08 08:14:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:14:01,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496756500] [2022-04-08 08:14:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:14:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:14:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:14:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-08 08:14:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:14:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {15371#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-08 08:14:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:14:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {15372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-08 08:14:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:14:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:14:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:14:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-08 08:14:01,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-08 08:14:01,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-08 08:14:01,254 INFO L272 TraceCheckUtils]: 1: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:01,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-08 08:14:01,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,255 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-08 08:14:01,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-08 08:14:01,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,255 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-08 08:14:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:14:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:01,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-08 08:14:01,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-08 08:14:01,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {15331#true} is VALID [2022-04-08 08:14:01,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-08 08:14:01,265 INFO L272 TraceCheckUtils]: 2: Hoare triple {15331#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:01,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:01,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-08 08:14:01,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {15331#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {15331#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {15331#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-08 08:14:01,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {15331#true} ~returnVal2~0 := 259; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-08 08:14:01,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-08 08:14:01,270 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {15331#true} #470#return; {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-08 08:14:01,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {15331#true} call ULTIMATE.init(); {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:14:01,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-08 08:14:01,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {15331#true} call #t~ret35 := main(); {15331#true} is VALID [2022-04-08 08:14:01,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {15331#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {15331#true} is VALID [2022-04-08 08:14:01,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {15331#true} call _BLAST_init(); {15371#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {15371#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {15331#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {15331#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L272 TraceCheckUtils]: 12: Hoare triple {15331#true} call stub_driver_init(); {15372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {15372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {15331#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {15331#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume 3 == ~tmp_ndt_1~0; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L272 TraceCheckUtils]: 19: Hoare triple {15331#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {15331#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {15331#true} assume 0 == ~irpStack__MinorFunction~0; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {15331#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {15331#true} assume !(~s~0 != ~NP~0); {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {15331#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {15331#true} is VALID [2022-04-08 08:14:01,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {15331#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {15331#true} is VALID [2022-04-08 08:14:01,275 INFO L272 TraceCheckUtils]: 26: Hoare triple {15331#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:01,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {15331#true} is VALID [2022-04-08 08:14:01,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-08 08:14:01,275 INFO L272 TraceCheckUtils]: 29: Hoare triple {15331#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:01,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L272 TraceCheckUtils]: 31: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:01,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-08 08:14:01,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {15331#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L272 TraceCheckUtils]: 39: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {15331#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {15331#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {15331#true} ~returnVal2~0 := 259; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-08 08:14:01,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-08 08:14:01,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-08 08:14:01,279 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {15331#true} #470#return; {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {15369#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {15369#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} assume !(259 == ~__cil_tmp23~0); {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {15332#false} assume ~status~0 >= 0; {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {15332#false} assume !(~myStatus~0 >= 0); {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {15332#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L272 TraceCheckUtils]: 58: Hoare triple {15332#false} call IofCompleteRequest(~Irp, 0); {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {15332#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {15332#false} assume !(~s~0 == ~NP~0); {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L272 TraceCheckUtils]: 61: Hoare triple {15332#false} call errorFn(); {15332#false} is VALID [2022-04-08 08:14:01,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {15332#false} assume !false; {15332#false} is VALID [2022-04-08 08:14:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:14:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:14:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496756500] [2022-04-08 08:14:01,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496756500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:14:01,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:14:01,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:14:01,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:14:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541549563] [2022-04-08 08:14:01,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541549563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:14:01,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:14:01,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:14:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550847237] [2022-04-08 08:14:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:14:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-08 08:14:01,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:14:01,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:14:01,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:01,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:14:01,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:14:01,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:14:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:14:01,323 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:14:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:02,020 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-08 08:14:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:14:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-08 08:14:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:14:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:14:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-08 08:14:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:14:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-08 08:14:02,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-04-08 08:14:02,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:02,104 INFO L225 Difference]: With dead ends: 144 [2022-04-08 08:14:02,104 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 08:14:02,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:14:02,105 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:14:02,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:14:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 08:14:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-08 08:14:02,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:14:02,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:02,237 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:02,237 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:02,239 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-08 08:14:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-08 08:14:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:02,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:02,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-08 08:14:02,240 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-08 08:14:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:02,242 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-08 08:14:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-08 08:14:02,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:02,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:02,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:14:02,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:14:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:14:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-08 08:14:02,244 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-04-08 08:14:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:14:02,244 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-08 08:14:02,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 08:14:02,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-08 08:14:02,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-08 08:14:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 08:14:02,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:14:02,399 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:14:02,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:14:02,400 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:14:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:14:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-04-08 08:14:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:14:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700613460] [2022-04-08 08:14:02,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:14:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 2 times [2022-04-08 08:14:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:14:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268214502] [2022-04-08 08:14:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:14:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:14:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:14:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-08 08:14:02,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 08:14:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {16264#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-08 08:14:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:14:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {16265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-08 08:14:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 08:14:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-08 08:14:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-08 08:14:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L272 TraceCheckUtils]: 1: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:02,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-08 08:14:02,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-08 08:14:02,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,530 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-08 08:14:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 08:14:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-08 08:14:02,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-08 08:14:02,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {16216#true} is VALID [2022-04-08 08:14:02,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-08 08:14:02,537 INFO L272 TraceCheckUtils]: 2: Hoare triple {16216#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:02,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-08 08:14:02,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {16216#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L272 TraceCheckUtils]: 12: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-08 08:14:02,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {16216#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {16216#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,540 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-08 08:14:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:14:02,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {16283#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:02,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,561 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16284#(not (= ~MPR3~0 |old(~s~0)|))} {16253#(= ~MPR3~0 ~s~0)} #472#return; {16217#false} is VALID [2022-04-08 08:14:02,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {16216#true} call ULTIMATE.init(); {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:14:02,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~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(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-08 08:14:02,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {16216#true} call #t~ret35 := main(); {16216#true} is VALID [2022-04-08 08:14:02,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {16216#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {16216#true} is VALID [2022-04-08 08:14:02,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {16216#true} call _BLAST_init(); {16264#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {16264#(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) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~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 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {16216#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {16216#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L272 TraceCheckUtils]: 12: Hoare triple {16216#true} call stub_driver_init(); {16265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {16265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-08 08:14:02,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {16216#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume 3 == ~tmp_ndt_1~0; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {16216#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume 0 == ~irpStack__MinorFunction~0; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {16216#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {16216#true} assume !(~s~0 != ~NP~0); {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {16216#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {16216#true} is VALID [2022-04-08 08:14:02,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {16216#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {16216#true} is VALID [2022-04-08 08:14:02,566 INFO L272 TraceCheckUtils]: 26: Hoare triple {16216#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {16216#true} is VALID [2022-04-08 08:14:02,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-08 08:14:02,566 INFO L272 TraceCheckUtils]: 29: Hoare triple {16216#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:02,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L272 TraceCheckUtils]: 31: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-08 08:14:02,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {16216#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {16216#true} is VALID [2022-04-08 08:14:02,567 INFO L272 TraceCheckUtils]: 39: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {16216#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {16216#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-08 08:14:02,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {16216#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,569 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume 259 == ~__cil_tmp23~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-08 08:14:02,571 INFO L272 TraceCheckUtils]: 55: Hoare triple {16253#(= ~MPR3~0 ~s~0)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {16283#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {16283#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 08:14:02,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,572 INFO L290 TraceCheckUtils]: 58: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,572 INFO L290 TraceCheckUtils]: 59: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-08 08:14:02,574 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16284#(not (= ~MPR3~0 |old(~s~0)|))} {16253#(= ~MPR3~0 ~s~0)} #472#return; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {16217#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;havoc #t~ret13; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {16217#false} assume ~status~0 >= 0; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {16217#false} assume !(~myStatus~0 >= 0); {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {16217#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L272 TraceCheckUtils]: 69: Hoare triple {16217#false} call IofCompleteRequest(~Irp, 0); {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {16217#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {16217#false} assume !(~s~0 == ~NP~0); {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L272 TraceCheckUtils]: 72: Hoare triple {16217#false} call errorFn(); {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {16217#false} assume !false; {16217#false} is VALID [2022-04-08 08:14:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:14:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:14:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268214502] [2022-04-08 08:14:02,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268214502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:14:02,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:14:02,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:14:02,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:14:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700613460] [2022-04-08 08:14:02,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700613460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:14:02,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:14:02,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:14:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932548834] [2022-04-08 08:14:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:14:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-08 08:14:02,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:14:02,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 08:14:02,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:02,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:14:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:14:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:14:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:14:02,624 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 08:14:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:03,081 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-08 08:14:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:14:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-08 08:14:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:14:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 08:14:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-08 08:14:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 08:14:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-08 08:14:03,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-08 08:14:03,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:03,140 INFO L225 Difference]: With dead ends: 133 [2022-04-08 08:14:03,140 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:14:03,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:14:03,141 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 63 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:14:03,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:14:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:14:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:14:03,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:14:03,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:14:03,142 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:14:03,142 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:14:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:03,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:14:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:14:03,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:03,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:03,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:14:03,142 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:14:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:14:03,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:14:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:14:03,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:03,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:14:03,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:14:03,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:14:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:14:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:14:03,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-04-08 08:14:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:14:03,143 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:14:03,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 08:14:03,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:14:03,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:14:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:14:03,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:14:03,145 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:14:03,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:14:03,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:14:09,888 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 08:14:09,889 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 08:14:09,889 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point L571-1(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,889 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,890 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-04-08 08:14:09,890 INFO L885 garLoopResultBuilder]: At program point errorFnFINAL(lines 577 584) the Hoare annotation is: true [2022-04-08 08:14:09,890 INFO L885 garLoopResultBuilder]: At program point errorFnEXIT(lines 577 584) the Hoare annotation is: true [2022-04-08 08:14:09,890 INFO L885 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) the Hoare annotation is: true [2022-04-08 08:14:09,890 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 288 422) the Hoare annotation is: true [2022-04-08 08:14:09,890 INFO L878 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L359(line 359) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L885 garLoopResultBuilder]: At program point L409(lines 409 411) the Hoare annotation is: true [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 288 422) the Hoare annotation is: true [2022-04-08 08:14:09,891 INFO L885 garLoopResultBuilder]: At program point L385(lines 369 418) the Hoare annotation is: true [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L352(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L386(lines 386 415) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L378(lines 378 382) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,891 INFO L878 garLoopResultBuilder]: At program point L370(lines 370 374) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L337(lines 323 368) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L387(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L321-1(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L885 garLoopResultBuilder]: At program point L404(lines 404 412) the Hoare annotation is: true [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L885 garLoopResultBuilder]: At program point L405(lines 405 407) the Hoare annotation is: true [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L389(lines 389 391) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L340-1(lines 339 349) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,892 INFO L878 garLoopResultBuilder]: At program point L398(lines 398 402) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L445(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L445-1(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,893 INFO L878 garLoopResultBuilder]: At program point L446-1(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L488(lines 488 495) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L451(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L480(lines 480 486) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) .cse1 (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L493-1(lines 475 497) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse6 (= ~setEventCalled~0 1)) (.cse7 (<= 259 IofCallDriver_~returnVal2~0)) (.cse5 (<= 5 ~MPR1~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse8 (not .cse0)) (.cse3 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (not .cse3) (not .cse4) (not .cse5) (and .cse6 (<= IofCallDriver_~returnVal2~0 259) .cse7 (= ~MPR3~0 ~s~0)) (and .cse6 .cse5 .cse4 .cse8 .cse3 .cse7 .cse9) (and .cse5 (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse8 .cse3 .cse9) .cse1 .cse2)))) [2022-04-08 08:14:09,894 INFO L878 garLoopResultBuilder]: At program point L456(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |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)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,895 INFO L878 garLoopResultBuilder]: At program point L541-1(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L529(lines 529 534) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L550(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L528(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-08 08:14:09,896 INFO L885 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: true [2022-04-08 08:14:09,896 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L505(lines 505 511) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L885 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 501 514) the Hoare annotation is: true [2022-04-08 08:14:09,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-08 08:14:09,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 08:14:09,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L192(lines 192 198) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse8 (= ~setEventCalled~0 1)) (.cse10 (<= 259 KbFilter_PnP_~status~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse13 (not .cse0)) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse11 (<= 5 ~MPR1~0)) (.cse12 (= ~NP~0 |old(~s~0)|)) (.cse14 (= ~NP~0 1))) (let ((.cse1 (not .cse14)) (.cse2 (not .cse12)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not .cse11)) (.cse5 (and .cse11 .cse9 (not (= KbFilter_PnP_~__cil_tmp23~0 259)) .cse12 .cse13 .cse14 .cse15)) (.cse6 (and .cse8 .cse11 .cse9 .cse12 .cse13 .cse14 .cse10 .cse15)) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and .cse8 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse9 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse10 (= ~MPR3~0 ~s~0)) .cse4 .cse5 .cse6 .cse7))))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L159(lines 159 265) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 276) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L192-2(lines 166 261) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L242-1(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,897 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 182) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L176-1(lines 171 183) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L201(lines 201 205) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 273) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L226-1(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L251-1(lines 247 253) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L144(lines 144 270) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,898 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse4 (= ~setEventCalled~0 1)) (.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse6 (<= 259 KbFilter_PnP_~status~0)) (.cse10 (<= 5 ~MPR1~0)) (.cse11 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse2 (not .cse11)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse10)) (.cse8 (and .cse4 .cse10 .cse5 .cse11 (not .cse0) .cse12 .cse6 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse6 (= ~MPR3~0 ~s~0)) .cse7 .cse8 .cse9) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse7 .cse8 .cse9)))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L194-1(lines 194 196) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L153(lines 153 267) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L120(lines 120 278) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L885 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 75 287) the Hoare annotation is: true [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L236-1(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 264) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L129(lines 129 275) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-04-08 08:14:09,899 INFO L878 garLoopResultBuilder]: At program point L220-1(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L187-1(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse2 (= ~setEventCalled~0 1)) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (<= 259 |KbFilter_PnP_#t~ret12|)) (.cse11 (not .cse0)) (.cse13 (= ~s~0 |old(~s~0)|)) (.cse14 (<= 5 ~MPR1~0)) (.cse15 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse5 (not .cse15)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse14)) (.cse8 (and .cse2 .cse14 .cse3 .cse4 .cse15 .cse11 .cse12 .cse13)) (.cse9 (and .cse3 (not (= |KbFilter_PnP_#t~ret12| 259)) .cse11 .cse12 .cse13)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and .cse2 (<= |KbFilter_PnP_#t~ret12| 259) .cse3 .cse4 (= ~MPR3~0 ~s~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L171(lines 171 183) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L138(lines 138 272) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L885 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 75 287) the Hoare annotation is: true [2022-04-08 08:14:09,900 INFO L885 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 269) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L114(lines 114 280) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L156(lines 156 266) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 277) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,900 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 274) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L141(lines 141 271) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L108(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L232(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L257-1(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L216(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L150(lines 150 268) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 279) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,901 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 206) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-08 08:14:09,903 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:14:09,904 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:14:09,906 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:14:09,915 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:14:10,062 INFO L163 areAnnotationChecker]: CFG has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:14:10,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:14:10 BoogieIcfgContainer [2022-04-08 08:14:10,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:14:10,098 INFO L158 Benchmark]: Toolchain (without parser) took 31588.55ms. Allocated memory was 194.0MB in the beginning and 417.3MB in the end (delta: 223.3MB). Free memory was 145.8MB in the beginning and 331.4MB in the end (delta: -185.7MB). Peak memory consumption was 223.4MB. Max. memory is 8.0GB. [2022-04-08 08:14:10,099 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:14:10,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.92ms. Allocated memory is still 194.0MB. Free memory was 145.6MB in the beginning and 167.7MB in the end (delta: -22.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 08:14:10,099 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 194.0MB. Free memory was 167.7MB in the beginning and 165.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:14:10,099 INFO L158 Benchmark]: RCFGBuilder took 555.96ms. Allocated memory is still 194.0MB. Free memory was 165.4MB in the beginning and 137.3MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-04-08 08:14:10,099 INFO L158 Benchmark]: TraceAbstraction took 30727.09ms. Allocated memory was 194.0MB in the beginning and 417.3MB in the end (delta: 223.3MB). Free memory was 136.7MB in the beginning and 331.4MB in the end (delta: -194.8MB). Peak memory consumption was 214.2MB. Max. memory is 8.0GB. [2022-04-08 08:14:10,100 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.92ms. Allocated memory is still 194.0MB. Free memory was 145.6MB in the beginning and 167.7MB in the end (delta: -22.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 194.0MB. Free memory was 167.7MB in the beginning and 165.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 555.96ms. Allocated memory is still 194.0MB. Free memory was 165.4MB in the beginning and 137.3MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 30727.09ms. Allocated memory was 194.0MB in the beginning and 417.3MB in the end (delta: 223.3MB). Free memory was 136.7MB in the beginning and 331.4MB in the end (delta: -194.8MB). Peak memory consumption was 214.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3477 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3469 mSDsluCounter, 4456 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2445 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4231 IncrementalHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 2011 mSDtfsCounter, 4231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 151 LocationsWithAnnotation, 805 PreInvPairs, 1062 NumberOfFragments, 6214 HoareAnnotationTreeSize, 805 FomulaSimplifications, 426 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 151 FomulaSimplificationsInter, 11576 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || (returnVal2 <= 0 && MPR1 == s)) || (((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - ProcedureContractResult [Line: 515]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 565]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 37]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(\old(pended) == 0)) || ((s == NP && pended == 0) && compRegistered == 0) - ProcedureContractResult [Line: 51]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || (((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && pended == 0) && compRegistered == 0) && !(MPR3 == s))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 577]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 288]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 437]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((SKIP1 == NP || setEventCalled == \old(setEventCalled)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) && ((((((((SKIP1 == NP || ((((((setEventCalled == 1 && NP == \old(s)) && 259 <= \result) && !(SKIP1 == NP)) && NP == 1) && 259 <= returnVal2) && s == \old(s))) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s)) || (((((returnVal2 <= 0 && NP == \old(s)) && !(SKIP1 == NP)) && NP == 1) && s == \old(s)) && \result <= 0)) || compRegistered == 0) || !(pended == 0)) - ProcedureContractResult [Line: 423]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(setEventCalled == 1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 523]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 501]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: 1 - ProcedureContractResult [Line: 75]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 08:14:10,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...